Method and system for pacing, acking, timing, and handicapping (path) for simultaneous receipt of documents

ABSTRACT

A computing device determines impactful content in transmittable content. The computing device assigns the impactful content in the transmittable content to one or more impactful block units. Each impactful block unit comprises a determined numbers of characters. The computing device extracts the one or more impactful block units from the transmittable content. The computing device places the one or more impactful block units at the end of the transmittable content. The computing device transmits the transmittable content to a plurality of intended recipients. Each character, or a small packet set of sequential characters, of the determined number of characters of the one or more impactful block units is transmitted using a time delay for a particular intended recipient and a pacing method. The one or more impactful block units are to be received substantially simultaneously by the plurality of intended recipients.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.14/243,143, filed Apr. 2, 2014, which is a continuation of U.S. patentapplication Ser. No. 13/198,795, filed Aug. 5, 2011, now U.S. Pat. No.8,738,798, which claims the benefit of U.S. provisional patentapplications Nos. 61/371,379, filed Aug. 6, 2010, 61/371,412, filed Aug.6, 2010, 61/371,444, filed Aug. 6, 2010, 61/371,487, filed Aug. 6, 2010,61/373,034, filed Aug. 12, 2010, 61/379,961, filed Sep. 3, 2010,61/448,925, filed Mar. 3, 2011, and 61/479,182, filed Apr. 26, 2011, thedisclosures of which are incorporated herein by reference in theirentirety.

FIELD OF THE INVENTION

The present invention relates generally to a method and system for aninformation distribution service. More specifically, the presentinvention relates to providing simultaneous receipt of impactfulinformation by a plurality of recipients over either a “push” or a“pull” network of multiple servers.

BACKGROUND OF THE INVENTION

Many businesses, particularly financial institutions, are dependent upontimely reception of information from government agencies (e.g.,unemployment statistics) and from press release services reportinginformation and announcements concerning publicly traded companies(e.g., earnings reports, merger offers and possibilities, etc.). In manyinstances involving the distribution of material or sensitiveinformation (e.g., information that may have an impact on the economy,markets, or a company's financial outlook/status), if one intendedrecipient receives the disclosed information even a relatively shorttime before another, then the one recipient may gain an unfair advantage(e.g., a financial advantage) over the other intended recipient(s) ofthe information. In such cases, information distribution services maydesire or be required to guarantee “simultaneous disclosure” of theinformation (e.g., a press release or other form of communication) toall or a subset of the intended recipients.

“Simultaneous disclosure” as used herein includes the distribution ofinformation in a ‘bias free’ manner (i.e., distribution which “plays nofavorites”) and wherein the disclosed information is received by all ofthe intended recipients within a ‘tight time tolerance’ (i.e., theintended recipients receive the information at substantially the sametime within a small acceptable tolerance which may be predeterminedbased on the nature of the underlying information). The term“simultaneous disclosure” is not strictly limited to distribution ofpress releases, but may apply to any sensitive and actionable content,or any content announcing availability of limited resources, such as anannouncement of an organization accepting applications for a job openingin which it is expected there will be many more applicants thanavailable job openings, or an announcement of ticket availability for anevent which is likely to be oversubscribed. Other applications includedistributing general information in which the time allowed to prepare aresponse is limited (e.g. RFP's for competitive contracts) or announcingthat the time to perform a particular action has commenced, and thatactions will be judged or rewarded on a “first-come, first-serve” basis.

In August of 2000, the Securities and Exchange Commission (SEC)promulgated Regulation Fair Disclosure (herein referred to as “Reg. FD”)designed to prevent selective disclosure by public companies to marketprofessionals and certain shareholders. To effectuate this purpose, Reg.FD requires “[w]henever an issuer . . . discloses any material nonpublicinformation regarding that issuer or its securities . . . the issuershall make public disclosure of that information . . . simultaneously,in the case of an intentional disclosure.” In this regard, Reg. FD isoften referred to as the “simultaneous disclosure” rule.

Conventional methods and systems have been developed in order to achieve‘simultaneous disclosure’ as required by Reg. FD or otherwise. Forexample, the release of government statistics, such as unemploymentdata, the U.S. government instituted a technique referred to as the“lock up” approach, wherein individuals with press credentials werebrought into a “lock up room”, presented with the information to bereleased, and given access to terminals (e.g., laptop computers) thateach could be used to transmit the information at a specific time butwith the transmission capability temporarily deactivated. Then, at thespecific time of release (e.g., exactly 8:30 AM EST), a central switchcontrolling all terminals is then used to activate the transmissioncapability of each terminal all at once, permitting the information tobe transmitted from each terminal to the journalists' offices,presumably at the same time. However, this approach has the drawbackthat not all computer equipment for transmitting the information has thesame engineering such that the information is actually transmitted atthe same time. Moreover, this approach requires an increase in expensiveequipment and room for the system as the number of individualsincreases.

Another conventional method for providing “simultaneous disclosure” isvia satellite communication. Satellite transmission of information ordata has the advantage of being at such a high altitude that bits appearto “rain down” so that anyone who wishes to receive satellite datareceives it essentially at the same time. For this reason, the businesscommunity largely adopted this form of communication by the mid-1970s.For example, the PR (press release) wire services began using satellitesto build full domestic networks in the United States capable of sendingfinancial information quickly to media outlets all over the country. Asthe PR wire services became the accepted and trusted informationdisseminator for corporations, the PR wire services took on theadditional role as the official provider of “disclosure” for publiccorporations.

Demand for corporate information continues to grow as news andinvestment firms compete for the public's attention. Therefore, the roleof the PR wire services expanded to provide fast, electronic, and‘simultaneous’ disclosure of certain disclosures and press releaseinformation. Satellite technology emerged as the primary method forsimultaneously broadcasting the news and other information to thevarious media, investment, and research communities.

However, significant problems with using satellite technology for thispurpose also emerged. Because satellite transmissions to normalrecipients lacking high-powered uplinks are one-way broadcasts, there isno means to confirm that a transmission was successful. Therefore, wireservice transmissions are sent out “blind,” having no verificationmessage coming back from the media point to validate receipt of acommunication. Several methods have been employed to try to overcomethis lack of two-way communications, and therefore lack of anacknowledgement back channel (e.g., Forward Error Control, a separateterrestrial line for the acknowledgement channel), but all such methodslead to inefficiencies and higher costs of communication.

There were other cost considerations with regards to satellites. Formany years, satellite distribution was lower in cost than terrestriallines. However, with the increasing presence of mobile devices, demandfor satellite bandwidth (because it is wireless and a good match formobile applications) increased to the point that users have been forcedto pay a large premium to use satellites. Therefore, transmission andreception of time-sensitive information having disclosure requirementshas become increasingly and prohibitively expensive over satellites.

Introduction of the public Internet in the mid-1990's provided a newcommunications medium for the dissemination of news to the mediacommunity. As the Internet matured in the late 1990's, certainadvantages over satellite technology became apparent, such as cheaperinstallation, widespread availability, high-speed, and full-duplex,two-way communication. Accordingly, Internet technology became thepreferred alternative due to its faster, cheaper, global-reaching, andbi-directional characteristics.

However, the Internet has a major flaw that prohibits it from beingaccepted “as-is” as a viable communication vehicle for the disseminationof time-sensitive or Reg. FD-compliant information. The Internet'smulti-point packet forwarded architecture does not ensure thatinformation will reach multiple destinations/recipients in a fair andsimultaneous fashion. As such, there was a need for the ability toprovide near simultaneous delivery of information over any packet routednetwork, the public Internet in particular.

Existing protocols for simultaneous disclosure of electronicdocuments—described both in the open literature and in existing U.S.patents, such as, for example, U.S. Pat. No. 7,069,245 (hereinafter, the'245 patent), which is incorporated herein by reference in itsentirety—rely on encryption and essentially flow from the fundamentalwork on time-lock cryptography first announced on USENET by Timothy Mayin 1994. These techniques use a form of “lock up,” (i.e., an exactdigital analog to the aforementioned physical “lock up” used toguarantee simultaneous disclosure of U.S. government data). According tothis approach, the entire compilation of information (e.g., theelectronic document) is transmitted to all recipients in an encryptedform. The entire encrypted text is received by each recipient and storedon each recipient's local computer in advance of a pre-set release time,for example 10 A.M. EST. Next, at precisely the pre-set time (i.e., 10A.M. EST in this example), the decryption (“un-lock”) key is sent toeach recipient. Since decryption keys are small enough to fit in asingle packet, transmission of the key alone requires very littlebandwidth. As such, any difference in arrival times due to Internettransmission speed and quality are assumed to be negligible, since thosedifferences do not accumulate over multiple packets, as they would if anentire electronic document were transmitted.

Unfortunately, such encryption techniques fail the bias-free test, andthe difference in arrival time is not truly negligible, since the ownerof the fastest Internet connection always receives the key first.Furthermore, with encryption-based methods, a security break in theencryption used to safeguard the disclosed information results in thepremature release of the information. It also appears that theencryption techniques used for simultaneous disclosure also suffer intheory from an additional serious flaw in that they use a single key forall the electronic documents (e.g., press releases) that are released ina given minute, and send the “key-for-that-minute”once, in one packet.This approach exposes such techniques to a “known plaintext attack.” Ina “known plaintext attack,” the perpetrator “Blackhat” conspires with anumber of companies to send out press releases scheduled for release inthe same minute as the release Blackhat wishes to break. This guaranteesthat Blackhat will have access to plain-text/cipher-text pairs ofmessages all encrypted with the same key that Blackhat wishes todiscover, in advance of the release minute. Powerful techniques exist tohelp Blackhat find the key given this type of data, which is usuallynot, and should not, be available.

A system which implements simultaneous reception of impactfulinformation for a plurality of documents by a set of intended recipientsmay be implemented via a “push” network. As used herein, a “push”network presents information to a user without the user requesting theinformation.

Push networks implement “push services.” A push service copies anddistributes, to a plurality of user terminals, a packet sent by aninformation providing process, wherein the information providing processmay transfer packets at a regular interval or at a prescribed timewithout knowing the state of the individual user terminals. Users canoperate their user terminals whenever they wish and may extract theinformation that has been distributed. Since a push network is definedin advance, if it were built on top of fixed, dedicated lines, then the“equality of network connection speed” could be controlled or at leastcatered for. But if the push network is layered “virtually” on top ofthe public Internet, then the speed and latency of the networkconnection to each would-be recipient cannot be controlled.

Alternatively, a system which implements simultaneous reception ofimpactful information for a set of documents by a plurality of intendedrecipients may be implemented via a “pull” network. As used herein, a“pull” network presents information to a user after the user requeststhe information. In effect, the network is “polled” by the user.Typically the user may have an account with the system with a login andpassword. After the user logs in, the user makes a request for theinformation and expects to receive the information either immediately orat a specified time.

An example of a pull network may include a user computer connected tothe public Internet, wherein the user makes a request for content fromtheir Web browser which forwards the request over the Internet to a Webserver via the Hypertext Transfer Protocol (HTTP). Simple Web servershandle requests sequentially, i.e., requests are received in a certainnon-predetermined order, and then content is processed and sent to therecipients in the same order. Many modern Web servers use threads toprocess at least some of the requests that arrive approximately at thesame time substantially simultaneously, but the time of delivery mayvary based on connection speed, the server load, and the random order ofthe request arrivals, even if the requests are initiated by users at thesame time.

When a press release is to be released via a Web server, by displayingit on a Web page, at a known time, thousands or even tens of thousandsof users may use their Web browsers to request the document at the sametime. A user with access to many computers or Web browsers may send manymultiple requests, which would increase to near certainty the likelihoodthat at least one of that user's requests will be in a higher percentileof the requests to be processed first. This common practice givesmotivated users an advantage over others with regard to access tocontent, thereby violating “Reg. FD”. In fact, motivated users couldwrite or employ off-the-shelf automated software to create multiplerobotic “users”, and deploy an entire army of robots to request the Webpage. While there are Web server mechanisms to prevent access fromrobots, these mechanisms might make simultaneous disclosure worse byrequiring further human interaction, thereby leading to even furtherlack of access-time consistency across all of the users. Worse, turningback an army of robots does nothing to defeat an army of real humanusers who are colluding to access the Web page before other users.Well-financed organizations could employ “crowd sourcing”, marshallingthousands of individuals, potentially across many countries, to requestthe Web page. If an organization coordinates 1,000 users requesting theWeb page at the moment it is available, the odds are significantlyincreased that the organization obtains one copy of the Web page beforeother users, and therefore the information that is supposed to besimultaneously disclosed is received before many of the other users.Furthermore, users with fast Internet connections may receive a documentfaster than those with slower connections, even if the slower connectionis processed first by a Web server.

In the same manner, documents requested via the File Transfer Protocol(FTP) and other document transfer protocols have the same shortcomingsand are likely to violate of “Reg. FD” under circumstances similar toWeb servers employing HTTP.

Accordingly, what would be desirable, but has not yet been provided, isa method and system configured to facilitate and confirm simultaneousreceipt of certain sensitive information (i.e., electronic documents) bya plurality of intended recipients transmitted via a Web server over a“push” and/or a “pull” network, such as the Internet.

Financial traders and analysts may scan a press release for a singlestatement, such as a current earnings statement, and take an actionbased on a numeric value or other statement contained in the earningsstatement. This value may be compared to an expected target value. Thiscomparison effectively creates a condition upon which the trader oranalyst takes a particular action. This action is usually related to thestock market, such as buying or selling a stock, but may include otheractions such as calling someone on the telephone or making a notation ofthe company name for future research.

As used herein, an “action markup” is defined as placement of actionmessage(s) (e.g., buy/sell/hold) directly into a document for arecipient to act upon. The inclusion of an action message(s) is intendedto reduce the reaction time of a recipient needed to perform a certaintask. Action markup is not strictly limited to the insertion of simpleaction messages, but may include computer implemented calculationsand/or decision making to produce action(s) based on one or more usersettable conditions.

It would be desirable for a recipient to simply receive the value ofinterest, or better, for the recipient to receive a specific instructionat press release time. Unfortunately, current instruction deliverymethods known in the art do not comply with “Reg. FD.” For instance, ifone recipient receives an entire earnings release, and a secondrecipient receives only an instruction, such as the word “sell,” thefirst recipient may need to wait for the entire earnings release todownload, and is therefore at a severe disadvantage. The time it takesthe first recipient to download the entire earnings release and scan forthe value of interest before making a decision permits the secondrecipient to have a greater opportunity to take an action before thefirst recipient.

A variation of the concept of “action markup” is “editorial markup.” An“editorial markup” is similar to an “action markup” wherein, instead ofreceiving an instruction to take an action, the recipient may receiveeditorial information/messages, such as an editor's opinion or factsabout the impactful content, including insight into other relevantinformation. Herein we refer to either “action markup” or “editorialmarkup” as “trader markup”.

What would be desirable, but has not yet been provided, is a method forproviding trader markup within documents to be disclosed substantiallysimultaneously according to Reg FD.

What would also be desirable, but has not yet been provided, is a methodand system configured to facilitate and confirm simultaneous receipt ofcertain sensitive information (i.e., electronic documents) by aplurality of intended recipients transmitted via a Web server over a“push” and/or a “pull” network, wherein the documents transmitted are inbinary (non-ascii) formats.

Web servers may host Web pages with press release content as part of“Notify and Access.” As used herein, Notify and Access refers to thepractice of employing a press release service to transmit to Webbrowsers associated with press release subscribers a URL or hyperlinkthat links to press release content, rather than transmitting the entirepress release content over the press release service to the pressrelease subscribers. Notify and Access notifies the press releasesubscribers that a press release is available on a Web page of a remoteWeb server, and through the press release, subscribers may then accessthe Web page and the press release through their Web browser.

A deficiency of currently employed Notify and Access services is that aWeb server displaying a Web page with a press release may be unaware ofwhen a notification has been sent to recipients, and consequently theWeb server may make the Web page available before the notification issent over the press release service. In such circumstances, automatedWeb crawling software or manual Web browser requests may be employed toview the Web page unfairly before press release subscribers have beennotified that the press release (document) is available.

As a result, what would also be desirable, but has not yet beenprovided, is a method and system configured to facilitate and confirmsimultaneous receipt of certain sensitive information (i.e., electronicdocuments) by a plurality of intended recipients transmitted via a Webserver, or multiple Web servers in a Web server farm, over a “push”and/or a “pull” network, wherein the Web server posts the sensitiveinformation (e.g., a press release) on at least one Web pagessubstantially simultaneously and wherein intended recipientssubstantially simultaneously receive a notification that the at leastone Web page is available for viewing.

SUMMARY OF THE INVENTION

The above-described problems are addressed and a technical solutionachieved in the art by providing a method for facilitating substantiallysimultaneous receipt of content included in at least one document by aplurality of intended recipients, comprising the steps of: delimiting atleast one portion of impactful content in the document to define atleast one impactful block (IBlock); delimiting a remaining portion ofcontent to define at least one non-impactful block (NIBlock); insertingat least one action markup following the at least one IBlock;transmitting the at least one IBlock to each of the plurality ofintended recipients; transmitting the action markup to at least oneintended recipient; wherein the at least one IBlock is receivedsubstantially simultaneously by the plurality of intended recipients.The method may further comprise the step of synchronizing connectionsfor each of the intended recipients following the at least one IBlockand the at least one NIBlock. The action markup may be transmitted tothe at least one intended recipient while other intended recipientswait.

According to an embodiment of the present invention, the at least oneIBlock comprises at least one IBlock unit, and wherein the step oftransmitting the at least one IBlock includes the step of transmittingthe at least one IBlock unit. The method may further comprise the stepsof: receiving at least one acknowledgement packet after a round triptime (RTT); and calculating a handicap time for the at least one IBlockunit based on the RTT; wherein the at least one IBlock unit istransmitted after a delay equal to the corresponding handicap time of anintended recipient in order from a smallest handicap time to a largesthandicap time. A handicap time may be set to a longest transmission timeof about ½ of a longest RTT of an IBlock unit from among all of theintended recipients with a transmission time of an IBlock unit for aparticular intended recipient subtracted.

According to an embodiment of the present invention, the at least oneaction markup may include an element identifier, a condition, and amessage. The element identifier is a name corresponding to an impactfuldata element indicative of at least one of the type of impactful dataelement and a number reference. The condition includes a target valueand a comparison, wherein target value is acted upon by the comparison.

According to an embodiment of the present invention, the method mayfurther comprise the step of transmitting a message to the at least oneof the intended recipients when the condition is met. The message may becommunicated to the at least one intended recipient by at least one of apop-up notification message, a changing of visual effects, andmanipulating another program via an Application Programming Interface(API). The at least one document may include multiple types of actionmarkups. The multiple types of action markups may correspond to oneimpactful data element. The at least one IBlock may include combinationsof conditions and messages. XML-style tags may be inserted about theaction markup.

According to an embodiment of the present invention, the method mayfurther comprise the step of pacing the transmission of at least oneIBlock unit. The step of pacing may further comprise the step oftransmitting the at least one IBlock unit in a pacing time period. Thepacing time period is equal to a reciprocal of a longest totaltransmission time taken for each intended recipient to receive all ofIBlock units divided by each recipient's number of IBlock units. Thehandicap time period and/or the pacing time period may be averaged orexponentially smoothed between sending of subsequent IBlock units.

According to an embodiment of the present invention, impactful contentrefers to any portion of the content included in an electronicinformation document that impacts a likelihood that an individual takessome form of a financial-related action. Impactful content includes atleast one impactful data element. An impactful data element includes atleast one of a key word, a character, a marker, a name, and a symbol. Animpactful data element may be identified by employing a pattern matchingmethod. The pattern matching method may include a regular expressionmatching method.

According to an embodiment of the present invention, a document maycomprise two documents that have different formats. The least one IBlockfor the two documents may have different lengths.

According to an embodiment of the present invention, the delimitingsteps may further comprise the steps of: (a) inserting a tag indicatinga start of an NIBlock at the beginning of a document and a tagindicating an end of an NIBlock at the end of the document, (b) scanningcontent until at least one impactful data element is found using apattern matching method, wherein the pattern matching method returns atleast a starting point index of a match to impactful content and alength of the impactful content, (c) inserting a tag indicating the endof a NIBlock and a tag indicating the start of an IBlock adjacent to thereturned starting point index of impactful content, (d) calculating anend position of the at least one IBlock based on the start point indexand the length of the impactful content, (e) inserting a tag indicatingan end of an IBlock and a tag indicating a beginning of an NIBlockadjacent to the calculated end position of the at least one IBlock, and(f) repeating steps (b)-(e) until the end of the document is reached.The delimiting steps may further comprise the step of re-scanning thedocument and combining an IBlock and an adjacent NIBlock into a largersingle IBlock if the total length of the adjacent NIBlock is below apredetermined length. The delimiting steps may further comprise the stepof dividing an IBlock into at least two ISubBlocks if a length of theIBlock is larger than a predetermined length.

According to an embodiment of the present invention, alternatively, thedelimiting steps may further comprise the step of: applying a match andreplace method to a document to produce matched impactful content,wherein matched impactful content is replaced by the matched impactfulcontent preceded and followed by a tagged string.

According to an embodiment of the present invention, the method mayfurther comprise the step of: receiving at least one request from eachof the plurality of intended recipients for a document during apredetermined period of time; and wherein the at least one IBlock unitis transmitted to each of the intended recipients after thepredetermined period of time.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention may be more readily understood from the detaileddescription of an exemplary embodiment presented below considered inconjunction with the attached drawings and in which like referencenumerals refer to similar elements and in which:

FIGS. 1A-1C are block diagrams of exemplary hardware architecturalconfigurations for an information distribution system, constructed inaccordance with an illustrative embodiment of the present invention;

FIGS. 2A-2D show exemplary configurations of software architecturalelements included in various combinations of the hardware configurationsof FIGS. 1A-1C, according to an embodiment of the present invention;

FIGS. 3A and 3B show an exemplary press release in HTML format includinginserted “semantic equivalent blocks” (SEB), in accordance with anembodiment of the present invention;

FIGS. 3C and 3D show the exemplary press release of 3A and 3B in plaintext format including inserted “semantic equivalent blocks” (SEB), inaccordance with an “SEB method” of the present invention;

FIG. 4 shows a process flow illustrating exemplary steps forimplementing an electronic document “marking stage”, according to an“SEB method” of the present invention;

FIGS. 5A and 5B shows two versions of an electronic information documentrelating to the same substantive information in plaintext format andHTML format, respectively, which have not yet been parsed, according tothe marking method of the present invention;

FIG. 6 shows a process flow illustrating exemplary steps for combiningtwo IBlocks with an intervening ‘too short’ NIBlock in greater detail,with emphasis on how counters and indices are calculated and employed tocombine IBlocks, according to an embodiment of the present invention;

FIGS. 7A and 7B show the content of the plaintext document of FIGS. 3Cand 3D as a complete marked document divided into individual NIBlocksand IBlocks and further divided into individual U's, according to anembodiment of the present invention;

FIGS. 8A and 8B show a process flow illustrating exemplary steps forimplementing a “document transmission” stage as it relates to thetransmission of a first document and a second document, according to anembodiment of the present invention;

FIGS. 9A and 9B show documents x1 and x2, respectively, of the exampledescribed above in FIGS. 5A and 5B, respectively, wherein a pacing,ACK'ing, timing, and handicapping (PATH) method has been applied todocuments x1 and x2, according to an embodiment of the presentinvention;

FIGS. 10A and 10B show documents x1 and x2 divided into a plurality ofSEB blocks after the document “marking stage” described in the aboveexample has been applied, according to an embodiment of the presentinvention;

FIGS. 11A and 11B show the SEB blocks of FIGS. 10A and 10B,respectively, designated as impactful and non-impactful blocks,according to the document “marking stage” of the present invention;

FIG. 12 show a simplified process flow illustrating exemplary steps forimplementing a “SEB method” as it relates to the transmission of atleast one document in a plurality of formats for a correspondingplurality of recipients for a “pull network,” according to an embodimentof the present invention;

FIG. 13 is a process flow illustrating the exemplary steps of FIG. 12 ingreater detail, with emphasis on the flow of data between the Web serversoftware modules and the PATH server software module, according to anembodiment of the present invention;

FIG. 14 is an exemplary Web page version of a “trader interface” forentering action markup information, according to an embodiment of thepresent invention; and

FIGS. 15A-15D include binary data of two GIF binary images to betransmitted using the PATH protocol, one with all black content, and onewith black and red content, respectively, according to an embodiment ofthe present invention.

It is to be understood that the attached drawings are for purposes ofillustrating the concepts of the invention and may not be to scale.

DETAILED DESCRIPTION OF THE INVENTION

Modern fast multi-processor computers, fast multiple Network InterfaceCards (NICs), and the low-latency of the current U.S. public Internetrender satellite and encryption techniques unnecessary, as morestraight-forward approaches based on timing are available for problemsof realistic size. A method for “simultaneous disclosure” of pressreleases/documents over the Internet which (1) “plays no favorites” and(2) gets a document to every customer at the same time “for all legal,regulatory, financial, and other practical purposes.”

Systems and methods according to exemplary embodiments of the presentinvention utilize timing-based methodologies to achieve substantiallysimultaneous disclosure/reception of impactful information in documentsat a plurality of recipient machines. As used herein, substantiallysimultaneous means receipt of impactful information within a document ata recipient machine within an acceptable time tolerance. An acceptabletime tolerance is within 100 milliseconds, preferably less than 10milliseconds.

As used herein, the term “electronic information document” is intendedto include, but is not limited to a compilation of material,time-sensitive, and/or Reg. FD-compliant information capable of beingelectronically transmitted in any known electronic format such as, forexample, HTML, plaintext, XML, etc. Certain embodiments of acomputer-implemented method of the present invention include atransmission module configured to measure the transmission time. Theterm ‘module’ or ‘computer module’ is intended to include, but is notlimited to, one or more computing devices configured to execute one ormore software programs configured to perform one or more functions. Asused herein, a “packet” denotes one or more characters/symbols/binaryvalues grouped together as a fixed unit for transmission, which may haveheader and trailed information prepended and appended, respectively.

Referring now to FIGS. 1A-1C, block diagrams of a plurality of hardwarearchitecture configurations of an exemplary document delivery system 10for achieving simultaneous disclosure of press releases/documents areillustrated, according to an embodiment of the present invention. Theexemplary document delivery system 10 is configured to meet theaforementioned design requirements. Referring now to FIG. 1A, thedocument delivery system 10 includes a server 12. The server 12communicates with a plurality of push and/or and pull recipient machines14 a-14 n, labeled recipient y1-recipient yN via the Internet 16 over awired or wireless LAN 18, 20, respectively. The server 12 is configuredto act as both a Web server executing Internet client/server softwaremodules and a PATH server executing a “Semantic Equivalent Block” (SEB)method that includes a Pacing Handicapping and Transmission (PATH)method to be described hereinbelow. As used herein, a “SemanticEquivalent Block” (SEB) software module and a Pacing, ACK'ing, Timing,and Handicapping (PATH) software module contain executable programs forguaranteeing substantially simultaneous receipt of “impactful”information within electronic information documents that comply with“Reg. FD” for push and/or pull clients to be described hereinbelow.

Referring now to FIG. 1B, the document delivery system 10 includes aserver 12. The server 12 communicates with a plurality of pull recipientmachines 14 a-14 g, labeled recipient y1-recipient yG via the Internet16 over a wired or wireless LAN 18, 20, respectively and a plurality ofpush recipient machines 14 h-14 n, labeled recipient yH-recipient yNdirectly over a wired or wireless LAN 22, 24. The server 12 isconfigured to act as both a Web server executing Internet client/serversoftware modules and a PATH server executing the SEB/PATH method.

Referring now to FIG. 1C, the document delivery system 10 includes aserver 12 a and a server 12 b. The server 12 a communicates with aplurality of pull recipient machines 14 a-14 g, labeled recipienty1-recipient yG via the Internet 16 over a wired or wireless LAN 18, 20,and the server 12 b communicates a plurality of push recipient machines14 h-14 n, labeled recipient yH-recipient yN directly over a wired orwireless LAN 22, 24. The server 12 a is configured to act as both a Webserver executing Internet client/server software modules and a PATHserver executing the SEB/PATH software methods. The head-end server 12 bis configured to act as a PATH server executing the PATH softwaremodules. The server 12 b may communicated to/from the server 12 a toemploy the Internet client/server software modules located in server 12a and vice versa. The document delivery system 10 may also include adatabase 15 for push clients.

The servers 12, 12 a, 12 b comprise a computer platform. The computingplatform may include a personal computer or work-station (e.g., aPentium-4 2.4 GHz or higher) comprising one or more processors whichincludes a bus system which may be connected to a computer readablemedium. The computer readable medium may be used for storing theinstructions of the servers 12, 12 a, 12 b to be executed by the one ormore processors, including an operating system, such as the Windows, MACOS X Version n, various flavors of UNIX, or the Linux operating system.The computer readable medium may further be used for the storing andretrieval of documents to or from a database server and to or from theInternet 16 over the wired or wireless LAN or WAN 18, 20 and to or fromthe recipient machines 14G-14H over the wired or wireless LAN or WAN 22,24. The computer readable medium may include a combination of volatilememory, such as RAM memory, and non-volatile memory, such as flashmemory, optical disk(s), and/or hard disk(s).

The exemplary document delivery system 10 is configured to exhibit a 10millisecond tolerance on time of receipt of impactful information,randomized over recipient for up to at least 150 recipients and 200documents a minute with an average length of 20 Kbytes. The documentdelivery system 10 transmit documents over the Internet 16 or directlyto the recipient machines 14 a-14 n using modern high-speed computers(say 0.5 GHz or better processors for the receivers and 2.4 GHz orbetter processors for the server for definiteness, all machinescurrently used in business meet this requirement) with an Internetconnectivity burstable to T3 speeds. One skilled in the art wouldappreciate that the document delivery system is not limited to aspecific time tolerance, total number of recipients, total number oftransmittable documents, total document length, or specific processorcharacteristics. The values listed herein are likely to improve overtime as technology improves over time.

FIGS. 2A-2D and Table A below show exemplary configurations of softwarearchitectural elements that may be divided between a Web server 30 and aPATH server 32 or combined into a single Web/PATH server 30′, accordingto an elements included in the various combinations of the hardwareconfigurations of FIGS. 1A-1C, according to an embodiment of the presentinvention. The Web server 30 may be modified to hold “pull” requests fora document for “pull” recipients, rather than immediately processing therequests, according to an embodiment of the present invention. The“pull” requests may be held and pooled with “push” requests to create asimultaneous disclosure group to be described hereinbelow. The Webserver 30 may be implemented in two basic configurations as shown inFIGS. 2A-2D: it may be a standalone Web server 30 with integrated PATHserver software, or it may be designed so that the PATH server softwareruns as a layer on top of the Web server 30. In the layered approach,the server(s) that implements the PATH server software may be on thesame machine and/or another machine. The document delivery system 10 mayhave other simultaneous disclosure groups from different sources whichit may integrate into the Web server's simultaneous disclosure group(s).The document delivery system 10 may combine subscribed “push” recipientsand “pull” recipients into one simultaneous disclosure group fortransmission, with no advantage to any one recipient in accordance with“Reg. FD.” The document delivery system 10 “formats” documents accordingto the “SEB method” and delivers formatted documents back to the Webserver 30 for transmission to intended recipients.

TABLE A Web Server and PATH Figure Number of Servers SoftwareImplementation 2A 2 Integrated 2B 2 Layered 2C 1 Integrated 2D 1 Layered

In FIG. 2A, there are two servers 30, 32 corresponding to a Web server30 and a PATH server 32, respectively. The PATH server 32 includes aPATH software module 34 that implements a plurality of routinesincluding the SEB/PATH protocol 35 to be described hereinbelow and anoptional “push” software module 36. The Web Server 30 includes a Webserver software module 38 that implements a plurality of Web-basedprotocols to be described hereinbelow including TCP/IP connectionssoftware 40. A complete PATH server software module 42, including a PATHWeb server software interface 44 for communication over the Internet viathe TCP/IP connections software 40, is integrated into the Web serversoftware module 38.

In FIG. 2B, there are two servers 30, 32 corresponding to a Web server30 and a PATH server 32, respectively. The PATH server 32 includes aPATH software module 34 that implements a plurality of routinesincluding the PATH protocol 35 and an optional “push” software module36. The Web Server 30 includes a Web server software module 38 thatimplements a plurality of Web-based protocols including TCP/IPconnections software 40. A complete PATH server software module 42,including a PATH Web server software interface 44 for communication overthe Internet via the TCP/IP connections software 40, is layered on topof the Web server software module 38.

In FIG. 2C, a single server 30′ is depicted which integrates both theWeb server 30 and the PATH server 32. The Web/PATH server 30′ includes aPATH software module 34 that implements a plurality of routinesincluding the PATH protocol 35 and an optional “push” software module36. The Web/PATH server 30′ includes a Web server software module 38that implements a plurality of Web-based protocols including TCP/IPconnections software 40. A complete PATH server software module 42,including a PATH Web server software interface 44 for communication overthe Internet via the TCP/IP connections software 40, is layered on topof the Web server software module 38.

In FIG. 2D, a single server 30′ is depicted which integrates both theWeb server 30 and the PATH server 32. The Web/PATH server 30′ includes aPATH software module 34 that implements a plurality of routinesincluding the PATH protocol 35 and an optional “push” software module36. The Web Server 30 includes a Web server software module 38 thatimplements a plurality of Web-based protocols including TCP/IPconnections software 40. A complete PATH server software module 42,including a PATH Web server software interface 44 for communication overthe Internet via the TCP/IP connections software 40, is layered on topof the Web server software module 38.

A person skilled in the art would appreciate that the Web serversoftware module 38 and the PATH server software module 42 and othermodules may be implemented across any number of machines with variouscombinations of software and hardware. This also includes server farmsand cloud computing, which may contain one or both of the Web serversoftware module 38 and the PATH server software module 42.

The Web server software module 38 may be designed as a proprietary,single-purpose system, wherein the Web server 30 is configured tospecifically handle simultaneous disclosure and is not used for otherpurposes. A plug-in or module for existing Web servers, such as, but notlimited to, an IIS web server plug-in or an Apache Web server module,may also be modified to handle simultaneous disclosure.

As described above, “pull” technologies may include any protocols ortransmission methods that are initiated by a request from a recipientand content is delivered to the recipient. An exemplary “pull”technology that may be modified to include the Web server softwaremodule 38 and the PATH server software module 42 is HTTP, wherein arecipient enters a Web address into a Web browser program to request aWeb page, and the Web page is delivered to the recipient via the Webbrowser program. Other public protocol pull technologies which may bemodified to employ the Web server software module 38 and the PATH serversoftware module 42 include, but are not limited to, FTP, RSS, Atom,Comet, Java pushlets, XMPP, BOSH, long-polling, forever frames, APE, andXHR Streaming. The WebSocket API and WebSocket protocol may bemodifiable to include the Web server software module 38 and the PATHserver software module 42, which include full-duplex communicationdirectly in the Web browser program.

The document delivery system 10 may further include RSS and/or Atom Webservers, which receive requests in the same manner as HTTP Web servers.The content that RSS Web servers deliver is in XML format. RSS and Atomspecify different XML tags, but the overall structure is the same.Content of a document might be shorter than typical plaintext and HTMLdocument versions, but would be designed to employ the same number of“impactful” and “non-impactful” blocks (i.e., IBlocks and NIBlocks,respectively, to be described hereinbelow) in a formatted document to betransmitted according the SEB/PATH method of the present invention.

The document delivery system 10 may further include FTP (File TransferProtocol) servers. FTP (File Transfer Protocol) is a common method fortransferring files over the Internet. FTP Web servers accept requestsfor files and transmit the files. An FTP Web server may be modified inthe same manner as an HTTP Web server to include the Web server softwaremodule 38 and the PATH server software module 42. Other file transferprotocols that may be used for simultaneous disclosure include, but arenot limited to, RCP (Remote Copy Protocol), SCP (Secure Copy Protocol),and SFTP (SSH File Transfer Protocol or Secure File Transfer Protocol).

The document delivery system 10 may create a primary recipient group,and further may create a secondary group, a tertiary group, etc.,hereinafter referred to as “following” groups, for simultaneousreception of the same document. A following group may be based onrequests received after a primary group has begun processing, and mayinclude recipients that were laggards and were therefore previouslypushed out of a group to a later following group. In a second scenario,if a second document becomes available immediately after a firstdocument, a simultaneous disclosure recipient group needs to be createdagain for that second document. According to another embodiment of thepresent invention, multiple simultaneous disclosure recipient groups anddocuments may be processed in parallel.

According to an embodiment of the present invention, rather than timingeach packet of an entire document to achieve simultaneous disclosure,the information distribution system and method described herein employs“semantic equivalent blocks” to represent a portion of the content ofthe electronic information document. As used herein, the term “semanticequivalent block” or an “SEB” includes, but is not limited to, at leastone character including a block, portion or segment of characters whichincludes the same amount of “impactful” or “non-impactful” contentirrespective of the particular format (e.g., HTML, XML, plain text,etc.) of the information across multiple documents. As used herein, theterm “impactful” refers to any portion of the content included in theelectronic information document that may cause or impact the likelihoodthat an individual will take some form of action, such as, for example,a financial-related action including the buying, selling, or holding ofa financial instrument. The term “impactful data element” is intended toinclude, but is not limited to, numbers, key words, phrases, characters,markers, names, symbols, or combination thereof (e.g., company names,person's names, dollar amounts, financial terms, positive or negativeadjectives, and dates) that are deemed impactful or of particularimportance. Exemplary “impactful” words and phrases include, but are notlimited to, “suspend,” “announce,” “disappointing,” “investigate,”“subpoena,” “negative guidance,” “positive guidance,” “loss,” “gain,”“layoff,” etc. Exemplary “impactful” symbols include, but are notlimited to, currency symbols such as “$”, “£”, and “

” followed by a sequence of digits which, taken together, represent amonetary amount of range of monetary amounts. A non-exhaustive list ofrules for considering what is defined as impactful content is describedhereinbelow in Table 1:

TABLE 1 Numbers and Symbols Can contain decimals or commas Preceded by adollar, euro, pound, or any other currency symbol. Followed by“dollars”, “pounds”, “euro”, etc. Followed by a percent Followed orpreceded by a Financial Word Not part of a date format Words and Phrasesa) Financial Increase Decrease Bought Sold Shares Per Share OfferingBuyback Earn/Earnings/Profit Bankrupt/Bankruptcy/Chapter 11 NegativeGuidance Positive Guidance b) Business Resign Hire Layoff ClassAction/Sue/Litigate/Harassment Merger/Acquisition c) Word numbers One,two, . . . eleven, twelve . . . twenty . . . hundred . . . thousand . .. million . . . , etc., (See Numbers rules)

According to an embodiment of the present invention, impactfulwords/phrases/symbols may be stored in a database or an ordinary file(e.g., text or XML document). The database or file may also containrules, expressions, productions, and formulas, including but not limitedto, regular expressions and wildcards, which in essence define possiblyinfinite families or patters of impactful text. Some examples of thesemay include: “bank*” (any word beginning with the four characters“bank”), “raised * guidance” (any three word phrase in which the firstword is “raised” and the third word is “guidance”), YYY (which might bea code for any valid year number), etc. Through the use of these lists,rules, etc., it can always be unambiguously determined if a particularsubject of text is or is not impactful by using a pattern matchingmethod as described hereinbelow.

According to an embodiment of the present invention, SEBs containingimpactful words/phrases/symbols are referred to as impact blocks(hereinafter “IBlock”) and SEBs not containing impactfulwords/phrases/symbols are referred to as non-impact blocks (hereinafter“NIBlock”).

The identification, management and processing of SEBs in relation toelectronic information documents according to embodiments of the presentinvention is referred to herein as the “SEB method,” and is described indetail below.

FIGS. 3A-3D show two versions of an electronic information documentrelating to the same substantive information (the HTML-formatteddocument 200 in FIGS. 3A and 3B; and the plain text-formatted document202 in FIGS. 3C and 3D) processed in accordance with the SEB methodaccording to embodiments of the present invention, for transmission totwo recipient machines 14 a and 14 b. According to an embodiment of thepresent invention, an electronic information document may be a documentthat is pre-formatted according to requirements of different recipients(e.g., plaintext, HTML, XML, etc.) and stored in a database before a“marking stage” to be described hereinbelow, or may be formatted duringthe “marking stage” for each recipient from a single source document.

In the “marking stage” of the SEB method, the documents 200, 202 aremarked to delimit “semantic equivalent blocks” of text, according to anembodiment of the present invention. For electronic informationdocuments including Reg. FD-compliant information or other similarlysensitive information wherein simultaneous disclosure and reception isdesired, during the marking stage, certain “impactful data elements” areidentified. For example, in 3A-3D, in the “marking stage,” impactfuldata elements 204, 206, 208, 210 are identified in documents 200 and202.

According to an embodiment of the present invention, each of thedocuments 200, 202 is divided into SEBs that are regarded either asimpact blocks (“IBlock”) or non-impact blocks (“NIBlock”), depending onwhether they include impactful content or not, respectively. Each of theNIBlocks and IBlocks are terminated at the beginning and the end of theSEB by SEB tags that indicate that the specific block is an NIBlock orIBlock, respectively. IBlocks (SEBs) 212, 214 include at least oneimpactful data element 204-210. NIBlocks (SEBs) 216, 218, 220 do notcontain an impactful data element.

Referring again to FIGS. 3A-3D, and following the example above,according to an embodiment of the present invention, each of the SEBs212-220 is terminated by pair of SEB tags 230-248 which comprises two ormore computer-readable text symbols, e.g., ‘<block type=“I”>$0.06 pershare</block>’. The SEB tags 230-248 may be inserted into the text ofeach of the documents 200, 202 at a location preceding and following oneor more of the IBlocks 212, 214 and the NIBlocks 216-220. Tags maycomprise a variety of formats, including XML style (<blocktype=“I”></Block> or <block type=“NI”></Block>), HTML style(<IBlock></IBlock> or <NIBlock></NIBlock>), more literal HTML (<spanclass=“IBlock”></span> or <span class=“NIBlock”></span>), or any otherformat distinguishing IBlocks and NIBlocks.

Note that an IBlock may include impactful data elements, impactful dataelements plus formatting information, a plurality of impactful dataelements with intervening and/or surrounding formatting elements, or amultiplicity of impactful data elements and surrounding formattingelements with intervening non-impactful data elements. An example shownin FIGS. 3A-3D is “9.1% increase”, where both “9.1%” and “increase” areimpactful. An example of a compound plaintext IBlock including impactfuldata elements surrounding non-impactful data elements is as follows:

-   -   “loss of $68.9 million, or $4.68 per share”        has impactful data elements “loss of” and “$68.9 million”,        followed by non-impactful conjunctive elements “, or”, followed        by impactful data elements “$4.68” and “per share”. Consecutive        impactful data elements may be considered as one impactful        phrase that is determined during the marking stage as one large        IBlock or two separate ISubBlocks, and impactful data elements        having intervening non-impactful conjunctive elements may        combined into a single IBlock. According to certain embodiments        of the present invention, an IBlock may include an entire table        of values in various formats, such as an HTML table containing        financial values as depicted hereinbelow.

<table>    <tr>   <td>    $1,000   </td>   <td>    $2,000   </td>  </tr> <tr>   <td>    $5,000   </td>   <td>    $6,000   </td>  </tr> </table>

Conversely, IBlocks that are too long, perhaps longer than about 50bytes, may be divided into two or more ISubBlocks (tagged as, forexample, <block type=“ISub”>), which may be further divided into aplurality of smaller ISubBlocks until an acceptable ISubBlock length isachieved.

According to an embodiment of the present invention, impactful dataelements may be identified and marked/tagged in documents during themarking stage by employing a pattern matching method. A person skilledin the art would appreciate that a suitable pattern matching methodwould include a regular expression matching method/function, such as,but not limited to one found in the Microsoft.NET Framework'sSystem.Text.RegularExpressions or GNU C libraries. FIG. 4 depicts anexample of applying a regular expression method for marking a documentinto SEBs comprising IBlocks and NIBlocks, according to an embodiment ofthe present invention. Suppose the initial document is simply:

-   -   “IBM made $300,000.00 this week.”

At step 400, an NIBlock tag is prepended to the beginning of thedocument to obtain:

“<block type=“NI”>IBM made $300,000.00 this week.”

At step 405, the content of the document is searched for at least oneimpactful data element using a pattern matching function, e.g., RegEx.This may be at least one of the impactful content symbols/wordsdiscussed above. At step 410, if at least one impactful data element isfound, the pattern matching function outputs the matched string (e.g.“$300,000”). At step 415, the pattern matching function may also returna starting point index of the match (e.g., character 26 from thebeginning of the document), and the length of the matching string inbytes (e.g., 11). At step 420, an SEB tag indicating the end of anNIBlock and an SEB tag indicating the start of an IBlock (e.g.,</block><block type=“I”>) is inserted adjacent to the returned startingpoint index to obtain:

“<block type=“NI”>IBM made </block><block type=“I”>$300,000.00 thisweek.

At step 425, since the length of the matching string is known, and thestarting point index is known, then the end position of the impactfuldata element of the IBlock is calculated as follows:New Length=Length of added tags (24)+length of match (11)=35End point of IBlock=Start Point (26)+New Length (35)=61

At step 430, an SEB tag indicating the end of an IBlock and thebeginning of an NIBlock (e.g., </block><block type=“NI”>) is insertedadjacent to the just calculated end position of the IBlock as follows:

 ″<block type=″NI″>IBM made </block><block type=″I″>$300,000.00</block><block type=″NI″> this week.″

At step 435, another SEB tag indicating the end of an NIBlock (e.g.,</block>) is appended to the end of the document as follows:

″<block type=″NI″>IBM made </block><block type=″I″>$300,000.00</block><block type=″NI″> this week.</block>″

If the document were longer and, for example, the word “week” were animpactful word, then, at step 440, steps 415-430 are repeated for thenext impactful data element found by the regular expression function(“week”) and so on, until the end of the document is reached. Note that,in certain embodiments, a document may be scanned initially in one passwith a regular expression that includes all possible impactful dataelements, or, in certain other embodiments, the document may be scannedor hashed repeatedly looking for a single type of impactful dataelement, or a plurality of types of elements. If the regular expressionfunction is applied to the document in multiple passes, the regularexpression function may be programmed to ignore preceding IBlock SEB tagtermination indicators.

In optional Step 445, the formatted document is re-scanned and an IBlockand an adjacent “short” NIBlock may be combined into a larger IBlock ifthe total length of the NIBlock is below a predetermined length.Alternatively, certain pairs of IBlocks and any intervening relativelyshort NIBlocks (e.g., containing connection words) may be combined intoa larger single IBlock if the total length of the NIBlock is below apredetermined length. In optional step 450, any IBlocks that are largerthan a second predetermined length are broken into pairs of smallerISubBlocks. In Step 455, Steps 400-450 are repeated for each of theremaining electronic information documents to be transmitted to theremaining recipient machines, wherein each of the documents are scannedand tagged for the same impactful data elements as in the firstdocument.

According to an embodiment of the present invention, alternatively, themarking method may include a match and replace method, wherein a matchedstring is replaced by the matched string followed by a tagged string.For example, the C# function RegEx Replace function may be employed tofind a matched string and immediately replace it with the same matchedstring surrounded by SEB tags. For example, if the pattern $###,###.##and “week” were found, all such matches would be replaced with:

-   -   <block type=“I”>$###,###.##</block> and <block        type=“I”>week</block>.

In the present example, this would transform:

 ″IBM made $300,000.00 this week.″ to  ″IBM made <blocktype=″I″>$300,000.00</block> this <block type=″I″>week</block>.″

From here, adjacent IBlocks may be joined by removing the tags betweenthem, and then </block> and <block type=“NI”> are inserted before andafter (respectively) the new tagged blocks to create the NIBlocks.

For illustrative purposes, FIGS. 5A and 5B shows two versions of anelectronic information document relating to the same substantiveinformation in plaintext format and HTML format, respectively, whichhave not yet been parsed, according to the marking method of the presentinvention. Parsing proceeds in the following example as follows.

Initially, an NIBlock “Before” SEB Tag is inserted at index 0, or thebeginning, of each document as follows:

NIBlock Before SEB Tag: ″<block type=″NI″>″ Plain text format <blocktype=″NI″>Company A earnings statement. Company A reported earnings of354 million dollars for fiscal year 2010. Analysts had been looking forearnings of 389 million to 406 million dollars for fiscal year 2010, butactual results were disappointing. Decreasing earnings was the result oftheir sales numbers. HTML Format <block type=″NI″><html><body><h1>Company A Earnings statement</h1> <p>Company A reported earnings of354 million dollars for fiscal year 2010. </p> <p>Analysts had beenlooking for earnings of 389 million to 406 million dollars for fiscalyear 2010, but actual results were disappointing.</p> <p>Decreasingearnings was the result of their sales numbers.</p> </body></html>

An NIBlock “After” SEB Tag is inserted at the end of each document asfollows:

NIBlock After SEB Tag: ″</block>″ Plain text format <blocktype=″NI″>Company A earnings statement. Company A reported earnings of354 million dollars for fiscal year 2010. Analysts had been looking forearnings of 389 million to 406 million dollars for fiscal year 2010, butactual results were disappointing. Decreasing earnings was the result oftheir sales numbers.</block> HTML Format <block type=″NI″><html><body><h1>Company A Earnings statement</h1> <p>Company A reported earnings of354 million dollars for fiscal year 2010, a decrease of 10%. </p><p>Analysts had been looking for earnings of 389 million to 406 milliondollars for fiscal year 2010, but actual results were disappointing.</p><p>Decreasing earnings was the result of their sales numbers.</p></body></html></block>

IBlocks are identified in each document and SEB tags are inserted aboutthem as follows:

IBlock Before SEB Tag: “</block><block type=“I”>”, Length: 24 IBlockAfter SEB Tag: “</block><block type=“NI”>”, Length 25

An End SEB Tag Insertion Index is calculated as: Match Index+MatchLength+IBlock Before SEB Tag Length

First IBlock Plain Text IBlock found: “354 million dollars” at index 78,length 19   Before SEB Tag   Insert IBlock Before SEB Tag at index 78  <block type=″NI″>Company A earnings statement.   Company A reportedearnings of </block><block type=″I″>354   million dollars for fiscalyear 2010.   Analysts had been looking for earnings of 389 million to406   million dollars for fiscal year 2010, but actual results were  disappointing.   Decreasing earnings was the result of their salesnumbers.</block>   After SEB Tag   Calculate end insertion point: 78 +19 + 24 = 121   Insert IBlock After SEB Tag at index 121   <blocktype=″NI″>Company A earnings statement.   Company A reported earnings of</block><block type=″I″>354   million dollars</block><block type=″NI″>for fiscal year 2010.   Analysts had been looking for earnings of 389million to 406   million dollars for fiscal year 2010, but actualresults were   disappointing.   Decreasing earnings was the result oftheir sales numbers.</block> HTML IBlock found: “354 million dollars” atindex 102, length 19   Before SEB Tag   Insert IBlock Before SEB Tag atindex 102   <block type=″NI″><html><body>   <h1>Company A Earningsstatement</h1>   <p>Company A reported earnings of </block><block  type=″I″>354 million dollars for fiscal year 2010.</p>   <p>Analystshad been looking for earnings of 389 million to 406   million dollarsfor fiscal year 2010, but actual results were   disappointing.</p>  <p>Decreasing earnings was the result of their sales numbers.</p>  </body></html></block>   After SEB Tag   Calculate end insertionpoint: 102 + 19 + 24 = 145   Insert IBlock After SEB Tag at index 145  <block type=″NI″><html><body>   <h1>Company A Earnings statement</h1>  <p>Company A reported earnings of </block><block   type=″I″>354million dollars</block><block type=″NI″> for fiscal   year 2010.</p>  <p>Analysts had been looking for earnings of 389 million to 406  million dollars for fiscal year 2010, but actual results were  disappointing.</p>   <p>Decreasing earnings was the result of theirsales numbers.</p>   </body></html></block>

Second IBlock Plain Text IBlock found: “389 million to 406 milliondollars” at index 211, length 34   Before SEB Tag   Insert IBlock BeforeSEB Tag at index 211   <block type=″NI″>Company A earnings statement.  Company A reported earnings of </block><block type=″I″>354   milliondollars</block><block type=″NI″> for fiscal year 2010.   Analysts hadbeen looking for earnings of </block><block   type=″I″>389 million to406 million dollars for fiscal year 2010,   but actual results weredisappointing.   Decreasing earnings was the result of their salesnumbers.</block>   After SEB Tag   Calculate end insertion point: 211 +34 + 24 = 269   Insert IBlock After SEB Tag at index 269   <blocktype=″NI″>Company A earnings statement.   Company A reported earnings of</block><block type=″I″>354   million dollars</block><block type=″NI″>for fiscal year 2010.   Analysts had been looking for earnings of</block><block   type=″I″>389 million to 406 milliondollars</block><block   type=″NI″> for fiscal year 2010, but actualresults were   disappointing.   Decreasing earnings was the result oftheir sales numbers.</block> HTML IBlock found: “389 million to 406million dollars” at index 242, length 34   Before SEB Tag   InsertIBlock Before SEB Tag at index 242   <block type=″NI″><html><body>  <h1>Company A Earnings statement</h1>   <p>Company A reported earningsof </block><block   type=″I″>354 million dollars</block><blocktype=″NI″> for fiscal   year 2010.</p>   <p>Analysts had been lookingfor earnings of </block><block   type=″I″>389 million to 406 milliondollars for fiscal year 2010,   but actual results weredisappointing.</p>   <p>Decreasing earnings was the result of theirsales numbers.</p>   </body></html></block>   After SEB Tag   Calculateend insertion point: 242 + 34 + 24 = 300   Insert IBlock After SEB Tagat index 300   <block type=″NI″><html><body>   <h1>Company A Earningsstatement</h1>   <p>Company A reported earnings of </block><block  type=″I″>354 million dollars</block><block type=″NI″> for fiscal  year 2010.</p>   <p>Analysts had been looking for earnings of</block><block   type=″I″>389 million to 406 milliondollars</block><block   type=″NI″> for fiscal year 2010, but actualresults were   disappointing.</p>   <p>Decreasing earnings was theresult of their sales numbers.</p>   </body></html></block>

Third IBlock Plain Text IBlock found: “disappointing” at index 341,length 13   Before SEB Tag   Insert IBlock Before SEB Tag at index 341  <block type=″NI″>Company A earnings statement.   Company A reportedearnings of </block><block type=″I″>354   million dollars</block><blocktype=″NI″> for fiscal year 2010.   Analysts had been looking forearnings of </block><block   type=″I″>389 million to 406 milliondollars</block><block   type=″NI″> for fiscal year 2010, but actualresults were   </block><block type=″I″>disappointing.   Decreasingearnings was the result of their sales numbers.</block>   After SEB Tag  Calculate end insertion point: 341 + 13 + 24 = 378   Insert IBlockAfter SEB Tag at index 378   <block type=″NI″>Company A earningsstatement.   Company A reported earnings of </block><block type=″I″>354  million dollars</block><block type=″NI″> for fiscal year 2010.  Analysts had been looking for earnings of </block><block  type=″I″>389 million to 406 million dollars</block><block   type=″NI″>for fiscal year 2010, but actual results were   </block><blocktype=″I″>disappointing</block><block   type=″NI″>.   Decreasing earningswas the result of their sales numbers.</block> HTML IBlock found:“disappointing” at index 372, length 13   Before SEB Tag   Insert IBlockBefore SEB Tag at index 372   <block type=″NI″><html><body>  <h1>Company A Earnings statement</h1>   <p>Company A reported earningsof </block><block   type=″I″>354 million dollars</block><blocktype=″NI″> for fiscal   year 2010.</p>   <p>Analysts had been lookingfor earnings of </block><block   type=″I″>389 million to 406 milliondollars</block><block   type=″NI″> for fiscal year 2010, but actualresults were   </block><block type=″I″>disappointing.</p>  <p>Decreasing earnings was the result of their sales numbers.</p>  </body></html></block>   After SEB Tag   Calculate end insertionpoint: 372 + 13 + 24 = 409   Insert IBlock After SEB Tag at index 409  <block type=″NI″><html><body>   <h1>Company A Earnings statement</h1>  <p>Company A reported earnings of </block><block   type=″I″>354million dollars</block><block type=″NI″> for fiscal   year 2010.</p>  <p>Analysts had been looking for earnings of </block><block  type=″I″>389 million to 406 million dollars</block><block   type=″NI″>for fiscal year 2010, but actual results were  disappointing</block><block type=″NI″>.</p>   <p>Decreasing earningswas the result of their sales numbers.</p>   </body></html></block>

Fourth IBlock Plain Text IBlock found: “Decreasing” at index 405, length10   Before SEB Tag   Insert IBlock Before SEB Tag at index 405   <blocktype=″NI″>Company A earnings statement.   Company A reported earnings of</block><block type=″I″>354   million dollars</block><block type=″NI″>for fiscal year 2010.   Analysts had been looking for earnings of</block><block   type=″I″>389 million to 406 milliondollars</block><block   type=″NI″> for fiscal year 2010, but actualresults were   </block><block type=″I″>disappointing</block><block  type=″NI″>.   </block><block type=″I″>Decreasing earnings was theresult of   their sales numbers.</block>   After SEB Tag   Calculate endinsertion point: 405 + 10 + 24 = 439   Insert IBlock After SEB Tag atindex 439   <block type=″NI″>Company A earnings statement.   Company Areported earnings of </block><block type=″I″>354   milliondollars</block><block type=″NI″> for fiscal year 2010.   Analysts hadbeen looking for earnings of </block><block   type=″I″>389 million to406 million dollars</block><block   type=″NI″> for fiscal year 2010, butactual results were   </block><blocktype=″I″>disappointing</block><block   type=″NI″>.   </block><blocktype=″I″>Decreasing</block><block type=″NI″>   earnings was the resultof their sales numbers.</block> HTML IBlock found: “disappointing” atindex 443, length 10   Before SEB Tag   Insert IBlock Before SEB Tag atindex 443   <block type=″NI″><html><body>   <h1>Company A Earningsstatement</h1>   <p>Company A reported earnings of </block><block  type=″I″>354 million dollars</block><block type=″NI″> for fiscal  year 2010.</p>   <p>Analysts had been looking for earnings of</block><block   type=″I″>389 million to 406 million dollars for fiscalyear 2010,   but actual results were </block><block  type=″I″>disappointing</block><block type=″NI″>.</p>  <p></block><block type=″I″>Decreasing earnings was the result   oftheir sales numbers.</p>   </body></html></block>   After SEB Tag  Calculate end insertion point: 372 + 13 + 24 = 409   Insert IBlockAfter SEB Tag at index 409   <block type=″NI″><html><body>   <h1>CompanyA Earnings statement</h1>   <p>Company A reported earnings of</block><block   type=″I″>354 million dollars</block><block type=″NI″>for fiscal   year 2010.</p>   <p>Analysts had been looking for earningsof </block><block   type=″I″>389 million to 406 milliondollars</block><block   type=″NI″> for fiscal year 2010, but actualresults were   </block><block type=″I″>disappointing</block><block  type=″NI″>.</p>   <p></block><block type=″I″>Decreasing</block><block  type=″NI″> earnings was the result of their sales numbers.</p>  </body></html></block>

After all IBlocks have been identified and delimited with SEB tags, eachof the documents may be re-scanned substantially simultaneously toremove NIBlocks that are “too short”, e.g., 10 characters or less in thecurrent example. After re-scanning the current documents, one of theNIBlocks is found to be two characters in length in the plain textversion and the corresponding NIBlock is found to be nine characters inlength in the HTML version. If one of the NIBlocks in a version wereover the “too short” threshold while the corresponding NIBlock inanother version were under the threshold, adjacent NIBlocks may becombined to keep the blocks in each document similarly marked.

FIG. 6 shows a process flow illustrating exemplary steps for combiningtwo IBlocks with an intervening ‘too short’ NIBlock in greater detail,with emphasis on how counters and indices are calculated and employed tocombine IBlocks, according to an embodiment of the present invention. Instep 600, an index counter is started for each document. In step 605,for each document, content is searched for an NIBlock “Before” tag(e.g., <block type=“NI”>). The first tag marking the first NIBlock isskipped since it cannot be removed, so searching may begin at index 1 toignore the tag match at index 0. In step 610, for each NIBlock found ineach document, a Start Index (SI) is located for the NIBlock in eachdocument. In step 615, after an NIBlock is located, the documents aresearched beginning after the Start Index to locate the next NIBlock“End” tag (e.g., “</block> tag), indicating the NIBlock has ended. Thissearch returns an index of the </block> tag, or the End Index. In step620, the length of the NIBlock “Start” tag is added to the Start Index,which is then subtracted from the End Index to determine the length ofthe NIBlock content. In step 625, if the length of each document'scontent is greater than a predetermined threshold, then in step 630,searching continues to the next NIBlock, and processing returns to step605. If, in step 625, the length in any of the documents is shorter thanthe predetermined threshold, then in step 635, an “After”NIBlock/“Before” IBlock tag pair is removed around the NIBlock in eachdocument (e.g., “</block><block type=“I”>”) from the end of the NIBlock,or after the End Index; the “Before” NIBlock tag (e.g., “<blocktype=“NI”>) is removed from the beginning of the NIBlock, or after theStart Index; and the “After” NIBlock tag (e.g., “</block>”) is removedthe beginning of the NIBlock, or before the Start Index. At step 640, ifthe end of the document has not been reached, the processing thenreturns back to step 605.

Below is an example of locating a ‘too short’ fourth NIBlock in theexample “marked” documents described above:

The next <block type=“NI”> tag is found and the Start Index is obtained.

Plain Text   Fourth NIBlock found at index 386; Start Index is 386.    <block type=“NI”>Company A earnings statement.     Company Areported earnings of </block><block type=“I”>354     milliondollars</block><block type=“NI”> for fiscal year 2010.     Analysts hadbeen looking for earnings of </block><block     type=“I”>389 million to406 million dollars</block><block     type=“NI”> for fiscal year 2010,but actual results were     </block><blocktype=“I”>disappointing</block><block     type=“NI”>.     </block><blocktype=“I”>Decreasing</block><block     type=“NI”>     earnings was theresult of their sales numbers.</block> HTML   Fourth NIBlock found atindex 417; Start Index is 417.     <block type=“NI”><html><body>    <h1>Company A Earnings statement</h1>     <p>Company A reportedearnings of </block><block     type=“I”>354 milliondollars</block><block type=“NI”> for     fiscal year 2010.</p>    <p>Analysts had been looking for earnings of </block><block    type=“I”>389 million to 406 million dollars</block><block    type=“NI”> for fiscal year 2010, but actual results were    </block><block type=“I”>disappointing</block><block    type=“NI”>.</p>     <p></block><blocktype=“I”>Decreasing</block><block     type=“NI”> earnings was the resultof their sales numbers.</p>     </body></html></block>

The next </block> tag is found and the End Index is obtained.

Plain Text   The </block> tag was found at 405; End Index is 405. HTML  The </block> tag was found at 443; End Index is 443.

The length of the NIBlock Content is calculated.

Plain Text   405 − (386 + 17) = 2. HTML   443 − (417 + 17) = 9.

Since one of the content lengths was below the predetermined threshold,the NIBlock SEB tags are removed from each document. </block><blocktype=“I”> is deleted from after the End Index in the plain text version(405) and HTML version (443). <block type=“NI”> is deleted from afterthe Start Index in the plain text version (386) and HTML version (417)</block> is deleted from before of the Start Index in the plain textversion (386) and HTML version (417). The index of the start of each</block> is calculated by subtracting the length of </block>(8) from theStart Index.

The resulting content is:

Plain text   <block type=“NI”>Company A earnings statement.   Company Areported earnings of </block><block type=“I”>354   milliondollars</block><block type=“NI”> for fiscal year 2010.   Analysts hadbeen looking for earnings of </block><block   type=“I”>389 million to406 million dollars</block><block   type=“NI”> for fiscal year 2010, butactual results   were </block><block type=“I”>disappointing.  Decreasing</block><block type=“NI”> earnings was the result of   theirsales numbers.</block> HTML   <block type=“NI”><html><body>  <h1>Company A Earnings statement</h1>   <p>Company A reported earningsof </block><block type=“I”>354   million dollars</block><blocktype=“NI”> for fiscal year 2010.</p>   <p>Analysts had been looking forearnings of </block><block   type=“I”>389 million to 406 milliondollars</block><block   type=“NI”>   for fiscal year 2010, but actualresults were </block><block   type=“I”>disappointing.</p>  <p>Decreasing</block><block type=“NI”> earnings was the result of  their sales numbers.</p>   </body></html></block>

As with removing “too small” NIBlocks, after all IBlocks have beenidentified and delimited with SEB tags, each of the documents may bere-scanned substantially simultaneously to split any IBlocks that are“too long,” e.g., 20 characters or more in the present example asfollows:

PlainText   <block type=“NI”>Company A earnings statement.   Company Areported earnings of </block><block type=“I”>354   milliondollars</block><block type=“NI”> for fiscal year 2010.   Analysts hadbeen looking for earnings of </block><block   type=“I”>389 million to406 million dollars</block><block   type=“NI”> for fiscal year 2010, butactual results   were </block><block type=“I”>disappointing.  Decreasing</block><block type=“NI”> earnings was the result of   theirsales numbers.</block>   “Too long” IBlock found:   <block type=“I”>389million to 406 million dollars</block>

The content of the IBlock is captured and the SEB tags of the IBlock areremoved:

389 million to 406 million dollars The first 20 characters may be splitand tagged with SubIBlock SEB Tags: 389 million to 406 m <blocktype=“ISub”>389 million to 406 m</block>

The second 20 characters of the remaining content of the same IBlock maybe split from the original content. If there are less than 20 charactersremaining in the content of the IBlock under consideration, this may bethe last ISubBlock. In the present example, the second ISubBlock is 14characters:

illion dollars <block type=“ISub”>illion dollars</block>

The new ISubBlocks are then combined and put back into the originaldocument:

<block type=“ISub”>389 million to 406 m</block><block type=“ISub”>illiondollars</block>

The resulting content is:

  <block type=“NI”>Company A earnings statement.   Company A reportedearnings of </block><block type=“I”>354   million dollars</block><blocktype=“NI”> for fiscal year 2010.   Analysts had been looking forearnings of </block><block   type=“ISub”>389 million to 406m</block><block type=   “ISub”>illion dollars</block><block type=“NI”>for fiscal year 2010,   but actual results were </block><blocktype=“I”>disappointing.   Decreasing</block><block type=“NI”> earningswas the result of   their sales numbers.</block> HTML   <blocktype=“NI”><html><body>   <h1>Company A Earnings statement</h1>  <p>Company A reported earnings of </block><block type=“I”>354  million dollars</block><block type=“NI”> for fiscal year 2010.</p>  <p>Analysts had been looking for earnings of </block><block  type=“I”>389 million to 406 million dollars</block><block type=  “NI”>for fiscal year 2010, but actual results were </block><block  type=“I”>disappointing.</p>   <p>Decreasing</block><block type=“NI”>earnings was the result of their sales numbers.</p>  </body></html></block> IBlock found:   <block type=“I”>389 million to406 million dollars</block>

The content of the IBlock is captured and the SEB tags of the IBlock areremoved:

-   -   389 million to 406 million dollars

The first 20 characters may be split and tagged with ISubBlock SEB Tags:

389 million to 406 m <block type=“ISub”>389 million to 406 m</block>

The second 20 characters of the remaining content of the same IBlock maybe split from the original content. If there are less than 20 charactersremaining in the content of the IBlock under consideration, this may bethe last ISubBlock. In the present example, the second ISubBlock is 14characters:

illion dollars <block type=“ISub”>illion dollars</block>

The new ISubBlocks are then combined and put back into the originaldocument:

<block type=“ISub”>389 million to 406 m</block><block type=“ISub”>illiondollars</block>

The resulting content is:

  <block type=“NI”><html><body>   <h1>Company A Earnings statement</h1>  <p>Company A reported earnings of </block><block type=“I”>354  million dollars</block><block type=“NI”> for fiscal year 2010.</p>  <p>Analysts had been looking for earnings of </block><block type=  “ISub”>389 million to 406 m</block><block type=“ISub”>illion  dollars</block><block type=“NI”> for fiscal year 2010, but actual  results were </block><block type=“I”>disappointing.</p>  <p>Decreasing</block><block type=“NI”> earnings was the result oftheir sales numbers.</p>   </body></html></block>

According to an embodiment of the present invention, the SEB methodfurther includes a “transmission stage” wherein each of the SEBs of aplurality of “marked” documents is transmitted to the recipient machines14 a-14 n by the document delivery system 10. By dividing each of the“marked” documents into the SEBs, each terminated by SEB tags, allrecipient machines 14 a-14 n may receive impactful informationsubstantially simultaneously, correctly released at the time needed toensure simultaneous receipt, as determined by the transmission receipttime of an SEB.

One having ordinary skill in the art will appreciate that embodiments ofthe present invention are not limited to the processing, transmissionand receipt of two documents, but any number of documents may beprocessed in accordance with the methodology set forth above with regardto FIG. 4. Furthermore, several disclosed information packages (e.g.,press releases) associated with the plurality of documents and recipientmachines 14 a-14 n can be processed substantially simultaneouslyaccording to embodiments of the present invention.

Documents may have multiple sizes based on different encodings andformats. A corresponding IBlock in a document to be received by each ofthe recipient machines 14 a-14 n (hereinafter, designated “recipient y”or “recipient yN”, where “yN” is an integer), may have different lengths(i.e., number of characters) denoted by L(y). Furthermore, each of therecipients y1-yN has a speed or rate of transmission, denoted R(y),which may vary from IBlock to IBlock and between documents. In order toguarantee substantially simultaneous receipt of impactful SEBs accordingto the principles outlined in FIG. 4, individual characters or bytes incorresponding IBlocks for each of the recipients y1-yN may betransmitted according to a pacing, handicapping, and timing (PATH)method to be described hereinbelow.

Suppose that a plurality of recipients y1-y4 have been processed in a“marking stage” in accordance with the SEB method of the presentinvention, and each of the plurality of recipients y1-y4 has acorresponding connection speed and IBlock content length given by Table2, where all data is in Bytes (B), seconds (s), or Bytes per second(Bps).

TABLE 2 Recipient (y) Connection Speed (R(y)) Content Size (L(y)) y1 100Bps 100 B y2 200 Bps 100 B y3 100 Bps  50 B y4 200 Bps  50 B

Knowing an IBlock length, the transmission time it takes for a recipientmachine 14 a-14 n to receive a corresponding IBlock from the documentdelivery system 10, denoted T(y), equal to L(y)/R(y), is given by Table3:

TABLE 3 Recipient Connection Speed Content Size Transmit time (y) (R(y))(L(y)) (T(y)) y1 100 Bps 100 B 1.00 s y2 200 Bps 100 B 0.50 s y3 100 Bps 50 B 0.50 s y4 200 Bps  50 B 0.25 s

For handicapping and pacing, the slowest T(y) in the recipient list isdetermined as:T=max{T(y)}orT=max{L(y)/R(y)}In the present example,

T=1 second.

In a pacing step, the content of an IBlock is “broken up” over T.Recipients that receive larger formatted content may be sent data morefrequently, whereas recipients with less formatting may have their datasent less frequently (i.e., spaced out or paced). The formula for pacingis represented as: P(y)=T/L(y), so that the pacing rate P(y) is givenfor each of the recipients y1-y4 as:P(y1)=1 second/100 bytes= 1/100 seconds per byte, or 100 BpsP(y2)=1 second/100 bytes= 1/100 seconds per byte, or 100 BpsP(y3)=1 second/50 bytes= 1/50 seconds per Byte, or 50 BpsP(y4)=1 second/50 bytes= 1/50 seconds per Byte, or 50 Bpsand summarized in Table 4 as:

TABLE 4 Recipient Connection Speed Content Size Transmit time Pacing (y)(R(y)) (L(y)) (T(y)) (P(y)) y1 100 Bps 100 B 1.00 s 100 Bps y2 200 Bps100 B 0.50 s 100 Bps y3 100 Bps  50 B 0.50 s  50 Bps y4 200 Bps  50 B0.25 s  50 Bps

To ensure that all of the recipients y1-y4 receive the same amount ofdata over T, each byte or character in an IBlock is paced. The numbersin Table 5 below represents the time that each byte number is sent toeach recipient:

TABLE 5 Time (ms) y1 y2 y3 y4 0 1 1 1 1 10 2 2 20 3 3 2 2 30 4 4 40 5 53 3 50 6 6 60 7 7 4 4 70 8 8 80 9 9 5 5 90 10 10 100 11 11 6 6 110 12 12120 13 13 7 7 130 14 14 140 15 15 8 8 150 16 16 160 17 17 9 9 170 18 18180 19 19 10 10 190 20 20

y1 and y2 are sent a byte every 10 ms to achieve data rates of 100 Bps,and y3 and y4 are sent a byte every 20 ms to achieve data rates of 50Bps. A pacing portion of the PATH method insures that all recipientsreceive the same amount of data over a maximum transmission time for anIBlock for any one recipient in time T. For example, pacing insures thaty1 and y2 receive their specified amount of data in the same amount oftime as y3 and y4 over a T of 1 second, rather than y3 and y4 receivingall bytes in the first 0.50 seconds. A person skilled in the art wouldappreciate that content in a corresponding IBlock for all fourrecipients is identical semantically. In the example given in Table 5above, the content of an IBlock for recipients y1 and y2 has moreformatting or a larger byte representation than the corresponding IBlockfor recipients y3 and y4.

In a handicapping portion of the PATH method, the sending time of eachcharacter of a corresponding IBlock is handicapped, or delayed, based ona recipient's connection speed. This insures that all recipients alsoreceive the data at the same time. A handicapping time for eachcharacter or byte in an IBlock, H(y), is given by:H(y)=(X Byte(T/L(y))−(1 B/(R(y))orH(y)=(X Byte*P(y))−(1 B/R(y))H(y1)=(1 B(1 s/100 B))−1 B/(100 B/s)=10 ms−10 ms=0 msH(y2)=(1 B(1 s/100 B))−1 B/(200 B/s)=10 ms−5 ms=5 msH(y3)=(1 B(1 s/50 B))−1 B/(100 B/s)=20 ms−10 ms=10 msH(y4)=(1 B(1 s/50 B))−1 B/(200 B/s)=20 ms−5 ms=15 ms

For each of the recipients, y1-y4, H(y) is given in the current examplein Table 6 as:

TABLE 6 Connection Content Transmit Recipient Speed Size time PacingHandicapping (y) (R(y)) (L(y)) (T(y)) (P(y)) (H(y)) y1 100 Bps 100 B1.00 s 100 Bps  0 ms y2 200 Bps 100 B 0.50 s 100 Bps  5 ms y3 100 Bps 50 B 0.50 s  50 Bps 10 ms y4 200 Bps  50 B 0.25 s  50 Bps 15 ms

The numbers in Table 7 below represent the time each byte number is sentfor each of the recipients, y1-y4.

TABLE 7 Time (ms) y1 y2 y3 y4 0 1 5 1 10 2 1 15 2 1 20 3 25 3 30 4 2 354 2 40 5 45 5 50 6 3 55 6 3 60 7 65 7 70 8 4 75 8 4 80 9 85 9 90 10 5 9510 5

y1 and y2 are both paced at 100 Bps, so a byte is transmitted every 10ms. y3 and y4 are both paced at 50 Bps, so a byte is transmitted every20 ms. y2's connection speed of 200 Bps permits y2 to receive a byte in5 ms, and y1 in 10 ms at 100 Bps. Using handicapping, y2's byte is sent5 ms after y1's byte, so that y1 and y2 receive a corresponding byteapproximately after 10 ms have passed. The same follows for handicappingy4's higher connection speed.

According to an embodiment of the present invention, the handicappingformula described above may be used to calculate when the first byte ofeach recipient's corresponding IBlock is to be sent, with a pacing valueadded for each subsequent byte send time. Alternatively, a bytetransmission number (1, 2, 3, etc.) may be assigned to calculate wheneach byte is sent.

According to an embodiment of the present invention, each of the IBlocksand NIBlocks may be further transmitted in preset units of bytes, orU's, a method herein designated as “unit-by-unit send” (UBUS). The sizeof a U may be fixed, and may be preset to as few as one byte or as manyas 100 bytes or more, depending on document length and transmissionspeed. In a preferred embodiment, both NIBlocks and IBlocks are sentusing U's of the same size, but only IBlocks have each character oftheir U's further paced and handicapped using the PATH method of thepresent invention to guarantee substantially simultaneous receipt ofIBlocks. FIGS. 7A and 7B show the content of the plaintext document ofFIGS. 3C and 3D as a complete a marked document 700; divided intoindividual NIBlocks 705 and IBlocks 710; and further divided intoindividual U's 715, each U having a size of four (4) bytes. Note that anindividual U may have fewer than the designated preset number of bytes,such as the U 720.

According to an embodiment of the present invention, recipienttransmissions may be synchronized (SYNCing or SYNC'ed) to ensurerecipients are receiving data simultaneously. After either a U or an SEB(i.e., IBlock or NIBlock) of data is transmitted to each recipient,transmission is paused in order to allow each recipient to receive apreviously sent U or SEB. SYNCing includes at least one method fordetecting when a U or SEB has been transmitted. According to certainembodiments of the present invention, a non-exhaustive list of methodsfor SYNCing may include the following:

Monitoring a socket for an acknowledgement packet (also referred to asan “ACK”): After a recipient receives data over TCP/IP, the recipientresponds with an ACK packet, which includes a sequence number and sizein bytes of the data received. The sequence number is unique for eachrecipient and is used to ensure that the ACK corresponds to the datathat was sent. The ACK size contained in the ACK packet contains thenumber of bytes successfully received. In a preferred embodiment, areceived ACK packet should include the sequence number that matches acorresponding sequence number of a packet that was sent to the recipientand the ACK number should match the number of bytes sent to therecipient.

Monitoring a socket send buffer and waiting for it to be empty, whichimplies that data has been sent: Though this indicates that a U or SEBhas been sent, it does not guarantee that the U or SEB was sentsuccessfully. In circumstances where a recipient did not receive a U orSEB, the recipient will not acknowledge receipt and the socket will sendthe U or SEB again.

After a transmission, the sending machine may wait a specified amount oftime for a recipient to respond. This wait period is likely to be twotimes the connection speed, or the expected Round Trip Time (RTT), plusa percentage for unexpected network latency. One having ordinary skillin the art will appreciate that ACK and RTT are well-known concepts inthe electronic communication arts and a part of the “network layer” oftransmission code. In certain embodiments of the present invention,ACK's and RTT's are moved “up” the protocol stack to the “applicationlayer” for use by the document delivery system 10 and the recipientmachines 14 a-14 n. After this amount of time has passed, anyconnections that have not responded with an ACK may be dropped from asimultaneous disclosure group (i.e. a group of the recipient machines 14a-14 n, e.g., 14 a-14 c). This ensures that other recipients are notdelayed. Recipients dropped from the simultaneous disclosure group mayeither be sent an error message or may be pooled into a retransmissiongroup to receive a retransmitted document after the simultaneousdisclosure group has been processed. After every recipient hasacknowledged receipt or has been dropped, the next round of transmissionmay begin.

According to an embodiment of the present invention, handicap times andpacing rates employed in the PATH method for transmitting IBlocks may bederived from information stored in ACK packets. The timing informationstored in ACK packets permits the calculation of round trip time (RTT)for potentially each U packet. Since many ACKs may be received over thelength of a document for substantially the same size packet, commonsmoothing/averaging algorithms known in the art, an exponentialsmoothing algorithm, such as preferably, but not limited to a Kalmanfilter, may be used to calculate an overall average transmission time ofa single U packet. Furthermore, the smoothed measurements are used togate transmission orders that thread (multiplex) multiple electronicinformation documents over a single channel. The exponential smoothingfilter examines a predetermined number of current and previous RTT timesand weighs more recent RTT times more heavily than prior RTT times. Inaddition, according to an embodiment of the present invention, serviceorder among recipient threads may be randomized.

Other methods for calculating the RTT include employing a timer, wherethe timer is started when a packet is transmitted, and stooped when itis received. Multiple timers may be employed for each packettransmitted, or a timer may be employed periodically or for one packetin each document.

Other methods for smoothing the RTT may be used, such as methods thatinclude the recent history and variability of captured RTTs on thedelivery circuit, as well as the knowledge of the routing and networkhops used for that circuit.

Furthermore, traceroute may be used in conjunction with the PATHtransmission software. The traceroute software permits PATH to determinethe ping time of each hop between itself and the recipient. An advancedmethod for calculating RTT may be used by calculating the average overtime of each hop, then adding the averages together to get a total RTT.

According to an embodiment of the present invention, the informationdistribution system is configured to detect one or more “laggard”machines among the plurality of recipient machines. As used herein, theterm “laggard” or “laggard machine” refers to a recipient machine thatfails to return an acknowledgment packet to the document delivery system10 within a period of time referred to as the “acknowledgmentthreshold.” As used herein, the term “acknowledgment threshold” refersto an initially predetermined and potentially subsequent adjustableamount of time in which receipt of the acknowledgment packet must occur.Upon detection of a laggard machine, the identified laggard machine istemporarily dropped from the simultaneous disclosure group, dropped onlyfor the current electronic information document release, to prevent thelaggard machine from delaying receipt by any of the other recipients.

Laggards may also be detected and removed from the simultaneous groupbefore a document begins transmission. If a recipient's ping time isabove a certain threshold, they may be removed from the simultaneousgroup. This threshold may be determined by using an exact ping time,such as any recipient with a ping time higher than 50 ms, or it may bedetermined dynamically, such as any recipient with a ping time higherthan 20% above average, or any other method that could be used todetermine outliers. Alternatively, a set number of recipients may beremoved, such as the slowest five recipients or slowest 5% ofrecipients.

Machines that appear to be slow by intentionally delaying one waycommunication, through a modified TCP stack or low level networkingdevice, and thereby falsifying their ping times, also need to beconsidered. These methods include any mechanism for delaying the receiptor transmission of content from or to the PATH software.

Optionally, the identification of any unusually long ACK response timesare retained and used for forensic analysis to compensate sending timedelays in addition to the exponential smoothing filter. Logs of allping, transmission, receipt, and any other time logs may be used foranalysis of machines that falsify times. These logs may be analyzed overthe course of a time period to detect inconsistencies, such as, but notlimited to determining patterns of increased or decreased ping timesimmediately before a release. Any abnormalities may result in expulsionof that machine from the simultaneous disclosure group until the problemis resolved.

Another method to determine inconsistencies between incoming andoutgoing ping times is through the use of ping validation on the clientsoftware. The client can send a one way ping to the AMPS software, whichwould send a ping back to the client along with the first received pingtime. The client can then compare the two for inconsistencies betweenthe times and report any abnormalities back to the PATH software.Encryption may be used for transmitting the ping time to the client aswell as the test results back to the PATH software to ensure thecontents are not tampered with.

Another method for deterring the use of artificially inflated ping timesto receive IBlocks faster is via splitting NIBlocks for transmission. Ifa cheating recipient is expecting alternating NIBlocks and IBlocks, andlowering their ping time in anticipation of receiving an IBlock, thePATH software may surprise and foil cheaters by splitting one or moreNIBlocks into two or more parts for transmission. This method permitsthe PATH software to reduce the effectiveness of a recipient modifyingtheir ping times between types of content.

Implementing traceroute in PATH could also be used to detect cheaters,where the recipient could be considered a cheater if one hop in theirroute is consistently taking longer than the others, or one hop makes upmore than a certain percentage of the total RTT. This permits the PATHsoftware to detect artificial lag in ACK responses created by recipientswith a modified IP stack or a low level network repeater with anartificially delayed outgoing response.

Multiple simultaneous groups can be created, where transmission from thesecond group begins after transmission of the first group completes,either immediately or after a specified amount of time, and so on forthe third, fourth, etc., groups. Laggards removed from a simultaneousgroup can be moved to the next simultaneous group for anothertransmission attempt, or they can be moved to the individual group afterone or a specific number of attempts. The individual group is a group ofrecipients who have been removed from the simultaneous group or who arenot part of the simultaneous group initially. The individual group istransmitted the document after one or all of the simultaneous groupshave completed transmission, without using the PATH transmissionprotocol.

In order to transmit many small uniformly sized packets, e.g., 4 bytes,(i.e., the U's) and calculate a consistent RTT, in a preferredembodiment, Nagle's algorithm is disabled so that the U's may beinserted into individual TCP packets and sent along with whatever headerinformation TCP adds. A person skilled in the art would appreciate thatNagle's algorithm is a feature of TCP which gathers multiple sets ofbytes and package them into one packet.

FIGS. 8A and 8B show a process flow illustrating exemplary steps forimplementing a “document transmission” stage as it relates to thetransmission of a first document and a second document for a “pushnetwork,” according to an embodiment of the present invention. In Step800, a recipient list for documents to be transmitted according to themarking method of FIG. 4 corresponding to at least one of the recipientsy1-yN is gathered by the document delivery system 10. In Step 805, allof the U's of the first NIBlock for each document are transmittedsequentially to each of the recipients y1-yN from the document deliverysystem 10 via the “push” network (e.g., the Internet 16 as shown in FIG.1). In Step 810, at least one acknowledgement packet (e.g., an ACK) fromeach of the recipients y1-yN is received by the document delivery system10 for each of the U's transmitted. In Step 815, an RTT is calculatedfor each of the recipients y1-yN based on a transmission time gatheredfrom the acknowledgement packets associated with each of the recipientsy1-yN. In Step 820, a connection speed of each of the recipients y1-yNis calculated and stored in the document delivery system 10. In Step830, connections for each of the recipients y1-yN are synchronized (i.e.SYNC'ed). In optional Step 835, an average or exponentially smoothed RTTis calculated for each of the recipients y1-yN based on the total numberof ACKs received and their corresponding derived RTTs and stored in thedocument delivery system 10.

In Step 840, each of the U's of the first IBlock (or ISubBlock) of eachof the documents 500, 502 are transmitted sequentially to each of therecipients y1-yN from the document delivery system 10 via the “push”network (e.g., the Internet 16 as shown in FIG. 1), according to thePATH method, wherein timing, pacing, and handicapping are based at leastin part on the average or exponentially smoothed RTTs gathered in Step835. In Step 845, at least one acknowledgement packet (e.g., an ACK)from each of the recipients y1-yN is received by the document deliverysystem 10 for each of the U's transmitted. In Step 850, a transmissionspeed is calculated for each of the recipients y1-yN based on atransmission time gathered from the acknowledgement packets associatedwith each of the recipients y1-yN. In Step 865, connections for each ofthe recipients y1-yN are synchronized (i.e. SYNC'ed). In Step 870, anaverage or exponentially smoothed RTT is calculated for each of therecipients y1-yN based on the total number of ACKs received and theircorresponding derived RTTs and stored in the document delivery system10. Alternatively, Step 870 may be performed for each successivelyreceived U averaged or smoothed with all previously NIBlock or IBlockU's.

In Step 875, if the next SEB to be transmitted is an NIBlock, then inStep 880, Steps 805-835 are repeated, otherwise in Step 885, the nextblock is an ISubBlock and the previous block was an ISubBlock and Steps840-870 are repeated. In Step 890, each of the remaining sets of SEBs ofeach of the corresponding documents is transmitted according to eitherSteps 875 or 880 until the last set of SEBs is transmitted.

In the context of applying the PATH method of the present invention interms of U's, handicapping is defined as calculating a transmissiondelay for each recipient to compensate for different connection speeds.After calculating an RTT time of each recipient, the RTT may be halved(½ RTT) to calculate the transmission time of one U for each recipient.To calculate the handicap for a particular recipient, the longesttransmission time (½ RTT) from among all of the recipients is determinedand the particular recipient's transmission time (½ RTT) is subtracted.Put another way, each recipient's handicap plus their transmission timeis equal to the longest transmission time, ensuring each recipientreceives the U at the same time.

In the context of applying the PATH method of the present invention interms of U's, pacing is define as calculating the frequency oftransmission of data for each recipient. Each recipient's data varies insize based on formatting (plaintext vs. HTML vs. XML, etc.). Data may bebroken into equally sized U's, and therefore, each recipient has adifferent number of U's to be transmitted. The total time it takes eachrecipient to receive all of the U's in their content is calculated todetermine the longest transmission time. This is calculated bymultiplying the number of each recipients U's by their time to transmitone U, or half of RTT, to calculate an overall time for each recipient,one of which is a longest total transmission time. For each recipient,the longest total transmission time calculated above is divided by eachrecipient's number of U's to calculate a frequency to transmit U's foreach recipient. The result is a time period for each recipient, so one Umay be transmitted at each calculated time period for each recipient.Therefore, each recipient is sent a different number of U's at differentfrequencies, across the same time period as determined by the longesttransmission time. Overall, recipients that receive larger sizedformatted content (with more U's) will be sent a U more frequently thanrecipients with smaller formatted content (fewer U's). The smallerformat recipients will have their U's transmitted father apart, orpaced, since there are fewer U's in their content. The handicappingmethod may then be applied to each U across pacing to ensure that thelast U is received at the same time for each recipient.

FIGS. 9A and 9B show documents x1 and x2, respectively, of the exampledescribed above in FIGS. 5A and 5B, respectively, wherein the PATHmethod has been applied to documents x1 and x2, according to anembodiment of the present invention. FIGS. 10A and 10B show documents x1and x2 divided into a plurality of SEB blocks after the marking methoddescribed in the above example has been applied, according to anembodiment of the present invention. FIGS. 11A and 11B show the SEBblocks of FIGS. 10A and 10B, respectively, designated as impactful andnon-impactful blocks according to the marking method of the presentinvention.

The example described hereinbelow illustrates an implementation of a“document transmission” stage that applies the PATH method to the firstNIBlock and IBlock of the electronic documents shown in FIGS. 9A-11B,respectively, according to an embodiment of the present invention. Aperson skilled in the art would appreciate that the PATH method of theSEB method of the present invention may be applied to subsequentNIBlocks and IBlocks in the same manner as described hereinbelow in asimilar fashion.

A block summary for each document x1, x2 of FIGS. 9A-11B is given belowin Table 8, indicating block number, block type, the number ofcharacters and bytes in each block, and the number of U's per block,assuming 4 byte/character size U's:

TABLE 8 Document Block Type Characters Bytes U's x1 1 NIBlock 61 61 16x1 2 IBlock 19 19 5 x1 3 NIBlock 65 65 17 x1 4 IBlock 20 20 5 x1 5IIBlock 14 14 4 x1 6 NIBlock 45 45 12 x1 7 IBlock 25 25 7 x1 8 NIBlock48 48 12 x2 1 NIBlock 84 84 21 x2 2 IBlock 19 19 5 x2 3 NIBlock 72 72 18x2 4 IBlock 20 20 5 x2 5 IIBlock 14 14 4 x2 6 NIBlock 45 45 12 x2 7IBlock 32 32 8 x2 8 NIBlock 67 67 17

Table 9 lists an example set of recipients y1-y4 in a simultaneousdisclosure group, each of which is to receive one of the documents x1,x2 of Table 8:

TABLE 9 Recipient Document y1 x1 y2 x1 y3 x2 y4 x2

NIBlocks may be transmitted without any pacing or handicapping. Each Umay be sent to the socket of each recipient within microseconds. Nagle'salgorithm may be turned off to ensure that packets may each be 36 bytes,including the 4 byte U and 32 bytes of TCP header information. Based onthe ACK responses from the packets sent to each recipient, the speed ofthe connection may be calculated for the 36 byte packets. Each recipientsends an ACK packet for each packet received, which results in a RoundTrip Time (RTT) in milliseconds. For each ACK received, the system maystore the RTT for each recipient. As more ACKs are received, the systemmay use the new RTT to calculate an average RTT time across each U inthe NIBlock.

One common algorithm for smoothing the RTT across multiple ACKs, asdescribed in W. Richard Stevens, “TCP/IP Illustrated, Volume 1: TheProtocols,” Page 299, is:R→xR+(1−x)M,where R is the stored RTT, M is the new measured RTT, and x is a factorbetween 0 and 1. A person skilled in the art would appreciate that anumber of other smoothing algorithms available may be applied, such asexponential smoothing.

For the transmission of IBlocks, IBlocks may be sent with or withoutpacing, according to certain embodiments of the present invention,followed by handicapping and transmission, according to an embodiment ofthe present invention. For both non-pacing transmission and pacingtransmission, from the RTT time, an estimated time to receive a U may becalculated based on half of the RTT. Since the size of the packet sentand the ACK packet are comparable in size, using the value of half ofthe RTT for transmission time is substantially accurate for one waytransmission speed. Handicapping may be viewed as calculating the delayof each U when the PATH method of the present invention is applicable.Alternatively, handicapping may be viewed in the context of the HATmethod of the present invention as delays for sending each of the U'swithout pacing.

Tables 10 and 11 summarize the transmission of NIBlock 1 of FIGS.10A-11B:

TABLE 10 Recipient Document Block 1 U Count y1 x1 16 y2 x1 16 y3 x2 21y4 x2 21

At time 00:000 (Seconds:Milliseconds), 16 U's are sent to Recipients y1and y2 and 21 U's are sent to Recipients y3 and y4, respectively. The 4byte U's are sent to the TCP socket sequentially within milliseconds.RTT for the U's transmitted are summarized in Table 11.

TABLE 11 Recipient RTT (ms) y1 32 y2 12 y3 18 y4 7

For the transmission if IBlock 2 without pacing, the half-RTT time isfirst calculated. The half-RTT's for IBlock 2 of FIGS. 11A and 11Bcorresponding to recipients y1-y4 are summarized in Table 12.

-   -   Half of the RTT

TABLE 12 Recipient RTT (ms) y1 16 y2 5 y3 9 y4 3.5

Each of the U's of IBlock 2 are sent in sequence to each of therecipients y1-y4 without pacing at time T(y), where T(y)=max{R(y)}−R(y)as summarized in Table 13.

TABLE 13 Time in ms y1 y2 y3 y4 0 5 Us 1 2 3 4 5 6 5 U's 7 8 9 10 11 5Us 12 12.5 5 U's 13 14 15

For the transmission if IBlock 2 without pacing, the Byte rate oftransmission may be calculated using the following formula:

$\begin{matrix}{( \frac{B}{( \frac{RTT}{2} )} ) \times 1000} & (1)\end{matrix}$

For each recipient y1-y4, the following Byte rates are obtained:y1=36 Bytes/(32 ms/2)*1000=2,250 Bpsy2=36 Bytes/(12 ms/2)*1000=6,000 Bpsy3=36 Bytes/(18 ms/2)*1000=4,000 Bpsy4=36 Bytes/(7 ms/2)*1000=10,286 Bps

To convert these rates to U's per second, the rates are divided by 36Bytes to obtain:y1=2,250 Bps/36 Bytes per U=62.5 Upsy2=6,000 Bps/36 Bytes per U=166.7 Upsy3=4,000 Bps/36 Bytes per U=111.1 Upsy4=10,286 Bps/36 Bytes per U=285.7 Ups

As a result, the estimated time for each recipient T(y) to receive theirIBlock at the Byte rate is as follows:T(y1)=5 U/62.5 Ups=0.080 s=80 msT(y2)=5 U/166.7 Ups=0.030 s=30 msT(y3)=5 U/111.1 Ups=0.045 s=45 msT(y4)=5 U/285.7 Ups=0.017 s=17 ms

The longest time for any one recipient to receive IBlock 2 (T) may becalculate as:T=max{t(y)}=80 ms

The formula for Pacing may be represented as:

$\begin{matrix} {P(y)}arrow\frac{T}{L(y)}  & (2)\end{matrix}$

When applied to each of the recipients y1-y4, the time for each U to besent is calculated as:P(y1)=80 ms/5 U=16 ms per U or 1 U/16 msP(y2)=80 ms/5 U=16 ms per U or 1 U/16 msP(y3)=80 ms/5 U=16 ms per U or 1 U/16 msP(y4)=80 ms/5 U=16 ms per U or 1 U/16 msand summarized in Table 14:

TABLE 14 Recipient Connection Speed Content Size Transmit time Pacing(y) (R(y)) (L(y)) (T(y)) (P(y)) y1  1 U/16 ms 5 U 80 ms 1 U/16 ms y2 1U/5 ms 5 U 30 ms 1 U/16 ms y3 1 U/9 ms 5 U 45 ms 1 U/16 ms y4  1 U/3.5ms 5 U 17 ms 1 U/16 ms

To ensure each recipient receives the same amount of data, 1 U is sentto each of the recipients y1-y4 every 16 ms at times 00:000, 00:015,00:031, 00:047 respectively.

The formula for Handicapping may be represented as:

$\begin{matrix}( \frac{1U}{R(y)} ) & (2)\end{matrix}$

When applied to each of the recipients y1-y4, the handicap time for eachof the recipients y1-y4 is summarized in Table 15:

TABLE 15 Recipient (y) Handicap (H(y)) y1 16 ms y2 5 ms y3 9 ms y4 3.5ms

To calculate the start time for each U, the following formula may beapplied where n is the number U to transmit:

$\begin{matrix}{( {{nU} \times \frac{T(y)}{L(y)}} ) - ( \frac{1U}{R(y)} )} & (3)\end{matrix}$

The first U for each recipient may be sent at times summarized in Table16.

TABLE 16 Recipient (y) Pacing (P(y)) Handicap (H(y)) Start Time y1 16 ms16 ms 0 ms y2 16 ms 5 ms 11 ms y3 16 ms 9 ms 7 ms y4 16 ms 3.5 ms 12.5ms

After the initial start time, each subsequent U is sent to eachrecipient 16 ms after the previous U has been sent, resulting in thefollowing send time of each U for each recipient as summarized in Table17.

TABLE 17 Recipient (y) U 1 U 2 U 3 U 4 U 5 y1 0 ms 16 ms 32 ms 48 ms 64ms y2 11 ms 27 ms 43 ms 59 ms 75 ms y3 7 ms 23 ms 39 ms 55 ms 71 ms y412.5 ms 28.5 ms 44.5 ms 60.5 ms 76.5 ms

The overall transmission of U's for the IBlock 2 for each of therecipients y1-y4 is summarized in Table 18.

TABLE 18 Time in ms y1 y2 y3 y4 0 1 U 1 2 3 4 5 6 1 U 7 8 9 10 11 1 U 1212.5 1 U 13 14 15 16 1 U 17 18 19 20 21 22 1 U 23 24 25 26 27 1 U 2828.5  5 U's 29 30 31 32 1 U 33 34 35 36 37 38 1 U 39 40 41 42 43 1 U 4444.5 1 U 45 46 47 48 1 U 49 50 51 52 53 54 1 U 55 56 57 58 59 1 U 6060.5 1 U 61 62 63 64 1 U 65 66 67 68 69 70 1 U 71 72 73 74 75 1 U 7676.5 1 U 77 78 79

After all of the U's are transmitted, the system waits for all of theACKs to be received in the process known as SYNC'ing described above. Aninitial maximum wait time may be set, e.g. 100 ms, for each of therecipient y1-y4 first ACK to be received. If no ACK's are receivedwithin that time from a recipient, that recipient may be removed fromthe simultaneous disclosure group. The recipient may then be placed intoa subsequent simultaneous disclosure group or the individual group. In apreferred embodiment, if an ACK is received from a given recipient, thesystem may wait up to twice the RTT time from the previous ACK for thenext ACK to be received from that recipient. A person skilled in the artwould appreciate that this is a common time out period used by TCP.

In the present example, if one or more ACK's are received at 8 ms, thesystem will wait up to 16 ms, or 8 additional ms, for more ACKs. Ifanother ACK is received after 12 ms, then the system will wait up to 24ms, or 12 more ms.

To reduce the delay of steadily increasing ACK receipts, the system mayremove recipients from a simultaneous disclosure group if ACK RTT timereaches the original timeout of 100 ms.

In a preferred embodiment, SYNC'ing may be applied at the end of eachNIBlock, IBlock, and SubIBlock. In another embodiment, SYNC'ing may alsobe applied between each U transmission in an IBlock during transmission.

According to a preferred embodiment of the present invention, a documentto be transmitted to a plurality of recipients y1-yN, each havingdifferent formats may first be retrieved from the database or othernon-volatile memory or received over the Internet 16 in plaintext or anyother format, and then reformatted in RAM according to previously storedpreferences of each of the recipients y1-yN. The SEB/PATH method maythen be applied entirely “on the fly”, wherein the marking stage and thetransmission stage are both performed in RAM. According to anotherembodiment of the present invention, the documents may be preformattedand stored in the database or received over the Internet 16, markedaccording to the SEB/PATH method in RAM, and transmitted in RAM.According to still another embodiment of the present invention, both theformatting and marking stages may be performed off-line in a database,etc., and the transmission stage performed in RAM. A person skilled inthe art would appreciate that any combination of the formatting andmarking stages may be performed off-line or at the same time as thetransmission stage of the SEB/PATH method of the present invention,without departing from the goal of guaranteeing substantiallysimultaneous receipt of impactful information.

According to an embodiment of the present invention, to insuresimultaneous disclosure of press releases/documents for “pull”recipients over a “pull” network, such as a plurality of recipientsmaking requests from and receiving impactful information delivered totheir Web browsers, the requests of recipients may be “pooled” into oneor more simultaneous disclosure groups for which one or more documentsin a desired format may be released at a predetermined later time usingthe SEB/PATH method of the present invention. Referring again to FIGS.2A-2D, if a document is scheduled to be released, the Web server 30 maybe customized to begin pooling requests for a set time period beforeand/or after a release date and time. For instance, for a scheduled10:00 AM document to be released, the Web server software module 38 maybegin pooling requests at 9:59:59.900 AM(Hours:Minutes:Seconds.Milliseconds) and finish pooling requests at10:00:00.099 AM. The Web server software module 38 may then pass thepooled recipients to the PATH server software module 42 (integrated orlayered) for processing the document according to the SEB/PATH method.The Web server software module 38 may continue to pool requests from10:00:00.100 AM and onward while the document is being processed by thePATH server software module 42 into a second simultaneous disclosuregroup. After the first group is finished processing, the Web serversoftware module 38 may send the second group to the PATH server softwaremodule 42 to be processed according to the SEB/PATH method.

This simultaneous disclosure “mode” may continue until a specified timehas elapsed when the document is no longer considered time-critical.After this time, the Web server software module 38 may begin processingrequests in a “pull” fashion.

FIG. 12 show a simplified process flow illustrating exemplary steps forimplementing an “SEB method” stage as it relates to the transmission ofat least one document in a plurality of formats for a correspondingplurality of “pull” recipients, according to an embodiment of thepresent invention. Referring now to FIGS. 2A-2D and 12, in Step 1200,the Web server software module 38 receives requests from a plurality ofrecipients y1-yN for at least one document. In Step 1205, the Web serversoftware module 38 pools the requests into a recipient list constitutingat least one simultaneous disclosure group for documents to betransmitted according to the “marking stage” of the SEB method of FIG.4, corresponding to at least one of the recipients y1-yN. In step 1210,after at least one simultaneous disclosure group is ready to beformatted/transmitted, typically determined by a certain amount of timeallowed for requests or a maximum predetermined number of recipients,the recipient list, along with any information about the request such asdocument type, is passed to the PATH server software module 42 forprocessing according to the “transmission stage” of the SEB/PATH methodof the present invention.

There may be multiple Web server software modules 38 handling differenttypes of requests in which respective recipient lists are forwarded toone or more PATH server software modules 42 substantiallysimultaneously. The Web server software module 38 in any given Webserver 30 may limit its number of requests. As a result, the documentdelivery system 10 may divide one simultaneous disclosure group into aplurality of simultaneous disclosure groups.

If there are “push” recipients, the document delivery system 10 maycombine the recipient lists from each Web server 30 with the recipientlist stored in a database table or a flat file in the database 15. Thedocument delivery system 10 may need to store attributes associated witheach recipient in a list so that the document delivery system 10 isconfigured to handle each type of recipient. One exemplary solution isto store for each recipient a flag attribute which may be either be aletter or number indicating the type of transmission (e.g., P for push,H for HTTP pull, F for FTP pull, etc). There may also be one or moreadditional attributes for storing information such as, but not limitedto, a recipient address, socket connection information, or any otherdetails necessary for transmission. One common method for maintaininginformation about recipients would be to create a recipient object orstructure, which may contain information about the recipient, including,but not limited to: a unique recipient number, the type of transmission,an IP address, or socket description or identifier, and the type ofdocument being transmitted.

In step 1215, the PATH server software module 42 processes one or moredocuments for transmission according to the PATH method of the presentinvention as indicated in FIGS. 8A and 8B according to a “marking stage”described hereinabove. The PATH server software module 42 divides theone or more documents to be transmitted into SEB Blocks (i.e., NIBlocksand IBlocks). The PATH server software module 42 may perform this taskbefore it receives a simultaneous disclosure group (list) if the one ormore documents were made available to the PATH server software module 42before release time. The one or more documents may also have beenprocessed from a previous simultaneous disclosure group if the currentsimultaneous group is a secondary or tertiary group. After the one ormore documents are processed, the PATH server software module 42 assignseach recipient a document type depending on their type of connection(e.g., a “push” or “pull” request and other information that may bepassed in with the request, e.g., an HTTP request typically requests anHTML formatted document, but may request XML formatted document).

In Step 1220, the PATH server software module 42 transmits NIBlocks andIBlocks to one or more Web server software modules 38 of one or more Webservers 30 according to the PATH method of the present invention asindicated in FIGS. 8A and 8B, according to a “transmission stage”described hereinabove. In Step 1225, the one or more Web Servers 30forwards NIBlocks and IBlocks to at least one recipient based on eachrecipient's attribute information. More particularly, Web server(“pull”) requests may be sent back to the Web server 30 that handled therequest for transmission, and “push” requests may be sent to the daemonhandling transmission for “push” recipients. Each of the NIBlocks andIBlocks may then transmit to the at least one recipient through theirrespective socket.

FIG. 13 is a process flow illustrating the exemplary steps of FIG. 12 ingreater detail, with emphasis on the flow of data between the Web serversoftware modules 38 and the PATH server software module 42, according toan embodiment of the present invention. FIG. 13 further exemplifies thecombination hardware/software configuration of FIG. 2B or 2D, whereinthe PATH server software module 42 is layered on top of the Web serversoftware modules 38. Before detailing the process flow of FIG. 13,presented herein are definitions of sub-component software moduleswithin the Web server software modules 38 and the PATH server softwaremodule 42, as well as data flow elements, documents to be transmitted,and the Internet.

The PATH server software module 42 includes the SEB/PATHprotocols/methods. Its primary purposes are for (1) handling documentmanagement, including formatting and blocking, (2) managing therecipient list, including assigning documents to each recipient, and (3)transmitting data to each recipient, including applying the PATHprotocol to the transmission of IBlocks. Some secondary tasks include(1) receiving documents from a document feeder or other type of contentdistribution method, (2) managing the timing of document releases andnotifying the Web Server software module 38 when documents areavailable, and (3) managing recipients from different sources, includingWeb server “pull” and “push” recipients.

The Web Server software module 38 is responsible for listening for HTTPrequests for documents that are released by the PATH server softwaremodule 42. The Web Server software module 38 includes a PATH SoftwareInterface 1310 and a connection pool 1316 that holds connections fromHTTP requests.

A Press Release 1303 is a document to be distributed substantiallysimultaneously with other documents. It is pushed to the Web Serversoftware module 38 with attributes such as time of release, which may beimmediately or in the future.

A Document Receiver 1304 is a portion of the PATH server software module42 that received documents. Typically this would be a TCP/IP socketlistening for connections from other servers pushing documents. It mayalso represent an FTP connection, where servers are pushing files to anFTP folder and the Document Receiver 1304 is waiting for the document tobe released.

A Document Manager 1306 is responsible for managing each document'srelease time. The Document Manager 1306 comprises a Document Store 1307and a timer to manage when a document is to be released. The DocumentManager also contains an On_Document_Available( ) function 1308 and isresponsible for passing the document to the Document Parser at theappropriate time for release.

The Document Store 1307 is a location where the Document Manager 1306stores documents if the documents are not ready for release. The storagemethod employed in the Document Store 1307 may include a database orflat file, and may include an indexing method for a document and thetime a document is to be released.

An On_Document_Available( ) function 1308 is a method of the DocumentManager 1306 invoked to coordinate tasks when a document reaches itsrelease time. An The On_Document_Available( ) function 1308 isresponsible for, but it not limited to, notifying a Connection PoolEnabler 1311 that a document is available, and passing the document tothe Document Parser 1321.

The PATH Software Interface 1310 is a portion of a customized Web Server30 that communicated with the PATH server software module 42 in alayered model. Its primary purpose is to communicate with the PATHserver software module 42 and Web Server software module 38, includingthe Connection Pool Enabler 1311 and a Connection Manager 1317. Note: inan integrated model as depicted in FIGS. 2A and 2C, the PATH SoftwareInterface 1310 may include all of the PATH server software module 42functions and no longer be an interface, becoming the PATH serversoftware module 42 itself. Also, some of the PATH Software Interfacefunctions may be combined with PATH Server Software module functions,since the functionality of the PATH Software Interface 1310 becomesredundant as a result of serving only as an intermediary between thePATH server software module 42 and Web Server software module 38.

The Connection Pool Enabler 1311 listens for a notification from theDocument Manager 1310 that a document is available. When a document isavailable, the Connection Pool Enabler 1311 informs the Web Serversoftware module 38 to begin pooling connections. After a predeterminedamount of time has passed, the Connection Pool Enabler 1311 informs theConnection Manager 1317 to pass a recipient list from the ConnectionPool 1316 to a Recipient Manager 1320 in the PATH server software module42. The Connection Pool Enabler 1311 also controls pooling foradditional requests and controls when a document is no longer sensitiveand may be served by the Web Server software module 38 in a fashion notrequiring simultaneous disclosure. The time at which a document becomesno longer sensitive may be a predefined default time stored in the WebServer software module 38, or it can be input by a user through a userinterface (not shown) from the Document Manager 1306.

The TCP/IP Connections 1314 in the Web Server software module 38 are thesocket connections created from HTTP requests. These are the connectionsfor one or more documents to be pushed back to a Web browser when theone or more documents are made available by the PATH server softwaremodule 42.

The Connection Pool 1316 is a portion of the Web Server software module38 that holds open HTTP request connections and pools them into a group.

The Connection Manager 1317 is an interface between both the ConnectionPool 1316 and TCP/IP Connections 1314 of the Web Server software module38 and both a Recipient Manager 1320 and a PATH Protocol Broadcaster1322 of the PATH server software module 42.

The Recipient Manager 1320 of the PATH server software module 42receives the recipient list from the Connection Manager 1317 and buildsa simultaneous disclosure group, combing push recipients and other Webserver pull recipients if implemented. It the takes the recipient list,assigns documents received from the Document Parser 1321, and passes therecipient list, documents, and document assignments to a PATH ProtocolBroadcaster 1322.

The Document Parser 1321 receives a document from the Document Manager1306 and creates SEBs for each document format based on the SEBprotocol. It then passes all of the formatted SEBs to the RecipientManager 1320.

The PATH Protocol Broadcaster 1322 takes the documents and recipientsand applied the PATH protocol to transmission of the SEBs. It transmitsSEBs to the Connection 1317 Manager for forwarding to the TCP/IPConnections 1314.

Returning to the particular process flow steps of FIG. 13, the pressrelease 1303 is made available to the PATH server software module 42.The press release 1303 is either a timed release (i.e., it is set to bereleased at a specific time in the future), or it is for immediaterelease. The press release 1303 is received by the Document Receiver1304 within the PATH server software module 42. The Document Receiver1303 passes the received press release 1305 to the Document Manager1306, which stores the press release 1303 in the Document Store 1307.The Document Manager 1306 determines if the press release 1305 isdestined for immediate release. If it is a timed release, the DocumentManager 1306 waits until a specified time, e.g., 500 milliseconds, priorto a predetermined release time, before it calls theOn_Document_Available( ) function 1308. If it is not a timed release,the Document Manager 1306 calls the On_Document_Available( ) function1308 immediately.

The On_Document_Available( ) function 1308 communicates 1309 with thePATH Software Interface 1310 in the Web Server software module 38. TheConnection Pool Enabler 1311 of the PATH Software Interface 1310 isnotified that the Web Server software module 38 may begin pooling HTTPrequests 1312 from users on the Internet 1313. The TCP/IP Connections1314 from the HTTP requests 1312 are passed 1315 to the Connection Pool1316.

After the press release 1305 is received by the Document Manager 1306,either immediately or after the predetermined release time passes, theDocument Manager 1306 passes the press release 1305 from the DocumentStore 1307 to the Document Parser 1321. The Document Parser 1321 formatsthe press release 1305 into one or more of a variety of formats andparses the document into SEBs. All of the formatted documents are thenpassed to the Recipient Manager 1320.

After a predetermined amount of time for receiving HTTP Requests 1312,e.g., 100 ms, the Connection Pool Enabler 1311 informs the ConnectionManager 1317 to collect the recipients 1318 in the Connection Pool 1316into a recipient list and pass 1319 the recipient list to the RecipientManager 1320 in the PATH server software module 42.

The Recipient Manager 1320 assigns document formats to each recipient inthe recipient list. The document formats, recipients, and documentassignments are passed to the PATH Protocol Broadcaster 1322.

The PATH Protocol Broadcaster 1322 performs the transmission of NIBlocksand IBlocks according to the PATH protocol and forwards document data1323 to the Connection Manager 1317, which forwards the document databack through the TCP/IP Connections 1314 to the requesting Web browsers1313.

Referring again to FIGS. 2A-2D and 12, as discussed above, the presentinvention contemplates employing multiple Web server software modules 38handling different types of requests in which respective recipient listsare forwarded to one or more PATH server software modules 42substantially simultaneously. According to an embodiment of the presentinvention, the PATH server software module 42 may be implemented andsynchronized across multiple networked PATH servers while still ensuringthat all recipients receive content substantially simultaneously. Insuch circumstances, each networked PATH server would both transmitcontent to its own list of recipients using the PATH method, andpossibly (depending on the synchronization method used) and maintain aglobal list of all recipients being served by all the networked PATHservers. As a result, long transmission times that may result from usingonly a single server to serve a widely-geographically-dispersed set ofrecipients may be reduced.

In a networked multiple PATH server implementation, synchronizationbetween PATH servers is needed to ensure transmission begins at the sametime across each of the PATH server. One method of synchronizationacross multiple networked PATH servers is to employ a “head-start”transmission time for the content as a whole to be delivered to each ofthe PATH servers (but not to any recipients) before a release time tothe recipients associated with each of the PATH servers. This ensuresthat each PATH server has received the content prior to a commencementof transmission to each of its respective recipients at a release time.For instance, if the content contains a publish time of 08:00:00 AM, thecontent source would send the content to each PATH server at 7:59:30 AM.The difference in the transmission “head-start” time and the publishtime needs to be large enough to ensure that each PATH server receivesthe content before it must be transmitted. The clocks of all involvedPATH servers need also to be synchronized to ensure transmission acrossthe PATH servers starts at substantially the same time.

According to an embodiment of the present invention, a second method ofsynchronization across multiple networked PATH servers is to designateone of the PATH servers as a “master” PATH server and the remainder ofthe PATH servers as “slave” PATH servers with respect to transmission ofcontent as a whole (i.e., without dividing the content into SEBs) fromthe “master” PATH server to the “slave” PATH servers. The master PATHserver is configured to receive the content to be transmitted to aplurality of recipients from a content source server (not shown). Themaster PATH server transmits the document to the slave PATH serversusing pacing and handicapping of the document as a whole. When eachslave PATH server receives the last byte of the content substantiallysimultaneously, each of the slave PATH servers, in turn, formats anddivides the document into SEBs according to the marking method describedhereinabove, and then transmits SEBs according to the transmissionmethod described above with respect to transmission, handicapping, andpacing of IBlocks to each of their recipients.

An aspect worth careful consideration with respect to the implementationof PATH across multiple servers is the synchronization of maximum pingtime across multiple PATH instances. Each of the slave PATH servers isnot only required to transmit based on a maximum handicap time acrossall of their own recipients, but also with respect to the longesthandicap time across all of the recipients associated with each of theslave path servers that are to receive the same document. One method toaccomplish this, using the master/slave PATH implementation, is toemploy a first modified version of the PATH server software module 42 onthe master PATH server and a second modified version of the PATH serversoftware module 42 on each of the slave PATH servers. The modified slavePATH server software module is adapted to maintain a list of ping timesfor each of its recipients, as used in the PATH method describedhereinabove to calculate handicap times. The modified slave PATH serversoftware module is also adapted to periodically transmit the ping dataassociated with each of its recipients back to the master PATH server,either in a form an entire ping list or only a maximum ping time. Themaster PATH server thus maintains a global list of ping times or maximumping time for each slave PATH server. The master PATH server thencalculates a master maximum ping time among of all ping times among allof the slave PATH servers. This master maximum ping time is thentransmitted periodically back to each slave PATH server, or transmittedat the time content is transmitted. Each slave PATH server thencalculates a handicap for each of its recipients based on the masterping time.

According to an embodiment of the present invention, another method forsynchronizing maximum ping time across all of the slave PATH servers isvia the use of a database. In such circumstances, there is no “master”PATH server, but a plurality of “peer” PATH servers and a centraldatabase server. Each peer PATH server software module 42 may beconfigured to coordinate ping times with other peer PATH servers. Thistypically would be implemented with a database server, wherein each peerPATH server updates the central database server with the ping times ofeach recipient, then queries a table maintained by the database serverthat contains ping data associated with all of the peer PATH servers toretrieve a maximum ping time. The database may be queried periodicallyto update the locally stored maximum ping time of each of the peers PATHservers, or it may be queried before transmitting each document.

According to an embodiment of the present invention, another method forsynchronizing maximum ping time across all of the slave PATH servers isfor a database to be associated with each of the peer PATH servers. Thepeer PATH servers may periodically exchange database ping tables/maximumping times with each other. In such circumstances, each of the peer PATHservers merely queries its local database to obtain the maximum ping.

A person skilled in the art would appreciate that other methods may beenvisioned for transmitting ping times between slave/peer PATH servers,such as, but not limited to, transmitting flat files, using a Webservice to retrieve maximum ping times from a centralized server, etc.

In such circumstances wherein a master PATH server/slave-peer PATHserver/database server or a path therebetween fails, slave/peer PATHservers may connect to other slave PATH servers to retrieve ping timedata and/or receive content. The connection between the master and slavePATH servers may be a dedicated or VPN connection to each slave PATHserver. If a link between the master PATH server and a slave PATH serverbecomes unavailable, the slave PATH server may connect to a differentslave PATH server to receive content. In this circumstance, thereconnecting slave PATH server may or may not apply PATH to transmissionsince the disclosure period has passed.

Slave PATH servers may be implemented in any part of the world, may bedesigned to handle any number of documents, and may have any number ofrecipients.

Certain embodiments of the present invention may be modified to work inconjunction with other methods of simultaneous disclosure, including anencryption method disclosed in the '245 patent. Handicapping in thiscase would be determined by the RTTs from ACK packets received aftersending encrypted content.

One method for providing action markup that complies with Reg. FD is toinclude action markup in a method that already complies with Reg. FD.The SEB/PATH method, as described hereinabove, may be modified toinclude action markup. The PATH method inherently ensures that eachrecipient receives impactful information, such as current earningsstatements, substantially simultaneously. After every recipient has beenguaranteed receipt of an impactful data block, or IBlock, via theSYNC'ing within the SEB/PATH method, then it is “fair” to provide anaction to at least one recipient. Such a method is Reg. FD compliantbecause all recipients have already received impactful information, andeach recipient has a fair opportunity to act upon it. By placing anaction markup after an IBlock, simultaneous disclosure is still assuredfor all impactful data.

According to an embodiment of the present invention, the “marking stage”of the SEB/PATH method would be modified to accommodate action markup byincluding an element identifier, a condition, and a message in additionto the encoding described above for demarcating impactful elements.Other optional attributes that may be associated with the action markupmay include, but are not limited to, user identification information,company information, and applicable date filters.

An “element identifier” is a name corresponding to an “impactful dataelement” described above, which may indicate the type of impactful dataelement, such as verbal description, e.g., “current_earnings”, or anumber reference. Element identifiers throughout a document should beunique. If an element identifier appears more than once in a document,the remaining action markup attributes (e.g., the “condition” and the“message”) may be placed only once after the first instance of theimpactful data elements having the same identifier, or, alternativelyeach instance may contain the full set of attributes of an “actionmarkup.” Typically, the “element identifier” matches the name of theelement tagged in the document, though this is not required.

The “condition” comprises two parts: a “target value” and a“comparison.” A “target value” is identified primarily, though notexclusively, by the recipient, which is typically a dollar amount or anumber. The “target value” is acted upon by the “comparison.” Examplesof comparison elements include, but are not limited to, less than,greater than, equal to, etc. The format of the “condition” attribute isdetermined and interpreted by the PATH client software (i.e., the PATHserver software module 42 of FIGS. 2A-2D, 12, and 13). The “condition”may include a complete text description, such as “less than 1,750,000million dollars”, or it may be simplified to something like “LT 1.75M”.The “condition” is formatted after the recipient enters their “actionmarkup information” via a “trader interface” to be described hereinbelowwith respect to FIG. 14.

For each “condition,” the recipient specifies a “message” to betransmitted in their received document if the “condition” is met. The“message” is usually related to the stock market, such as buying orselling stock, but may include other messages such as a reminder to callsomeone on the phone, making a note of the company for future research,or other key words to be recognized by their client software.

The action markup may include other information (i.e., attributes) usedby the PATH server software module 42, such as user identificationinformation, company information, and date filters. Some attributes maybe automatically created from the “trader interface”, such as the useridentification information, which may be taken from the “traderinterface”, after the recipient has logged in. Other optional attributesmay include a company and date information, also enterable via the“trader interface”. The company and date information may be used todetermine which documents to be sent to the recipient have an embeddedaction markup.

Since a document may have multiple IBlocks, a document may containmultiple types of action markups. Similarly, a document may containmultiple action markups for the same “impactful data element” or IBlockthat may comprise combinations of “conditions” and “messages.” Forexample, when comparing an earnings statement element to a target valueof $450,000, two “action markups” may be created for the earningsstatement, e.g., (1) if the earnings statement is less than $450,000,set the action “message” to “sell”, and (2) if the earnings statement isgreater than or equal to $450,000, set the action “message” to “buy”.

A document is modified to include at least one action markup during the“marking stage” of the SEB/PATH method during or just after theidentification of “impactful data elements” that may require an actionon the part of a recipient but before the document is divided into SEBs,such as, but not limited to earnings statements, sales figures, dollarvalues etc. An impactful data element that is to include an actionmarkup may be delimited by tags which are placed directly into thedocument surrounding the element. For example, an impactful data elementhaving an associated action markup that is indicative of an earningsstatement may be formatted as follows:

  Company A's earnings were <earnings>1.5 million for fiscal year2009</earnings>.

The above content may then be broken into SEBs, wherein the entireearnings element may be placed into an IBlock based on pattern matching,such as:

Company A's earnings were <IBlock><earnings>1.5 million for fiscal year2009</earnings></IBlock>. Analysts had been looking for earnings...

The tag for an action markup may be combined into an attribute of anIBlock tag if the IBlock has been identified first via pattern matching.After the blocks are tagged, the IBlocks may be searched for the targetelement and the IBlock tag may be modified to include the attribute,such as:

Company A's earnings were <IBlock type=“earnings”>1.5 million for fiscalyear 2009</IBlock>. Analysts had been looking for earnings...

An action markup tag is preferably an XML style tag, but may be anyother style tag which may contain attributes, such as HTML. Theattributes of the tag may include, but are not limited to, the elementidentifier, condition, and action message. An example of an XML styletag including an action markup is as follows:

-   -   <action element=“earnings” condition=“LT 1,750,000”        message=“sell” />

In the above example, the name of the tag is “action”, the elementidentifier attribute is “earnings”, the condition attribute is “LT1,750,000”, which represents “Less Than 1,750,000”, and the actionmessage attribute is “sell”.

After an IBlock has been tagged as an element, the action markup may beplaced into the document following the tagged IBlock and just after thebeginning of the subsequent NIBlock using “Markup Method 1”, accordingto an embodiment of the present invention, such as:

Company A's earnings were <IBlock type=“earnings”>1.5 million for fiscalyear 2009</IBlock><NIBlock><Action Element=“earnings” Condition=“LT1,750,000” Message=“sell” />. Analysts had been looking for earnings...

A second markup method (i.e., “Markup Method 2”) may include the actionmarkup tags between the IBlock and following NIBlock, such as:

Company A's earnings were <IBlock type=“earnings”>1.5 million for fiscalyear 2009</IBlock><Action Element=“earnings” condition=“LT 1,750,000”message=“sell” /><NIBlock>. Analysts had been looking for earnings...

Alternatively, the action markup may be placed before the IBlock if itdoes not contain any material which may help in determining the IBlockmaterial. For instance, the following content may be placed at thebeginning of the first NIBlock or at the end of the NIBlock precedingthe relevant IBlock:

<Action Element=“earnings” condition=“LT 1,750,000” if_message=“sell”else_message= “buy” />

In the above example, the action element is included independently ofthe IBlock content, and the action markup contains two messages, one tobe used if the condition is met, the other to be used if the conditionis not met. The PATH software would insert this action markup based onthe present IBlock, but would not perform any conditional processing.The recipient software would then process the action markup after theIBlock is received, determining which condition is met and perform anyother processing as indicated by the message.

Alternatively, the client could already have a database or local storagemechanism for storing action markup rules and conditions. These rulesand conditions can be maintained locally and edited before a pressrelease is expected to arrive. When a marked up IBlock arrives, such asan earnings release, the client software can refer to the local storageto determine the appropriate action based on the IBlock content and thecondition. The method eliminates the server side processing and permitsthe recipient to maintain their action conditions more efficiently.

An action markup may be entered for inclusion into a document fortransmission via, for example, a “trader interface”. The “traderinterface” may include, but is not limited to, a Web interface thatallows traders to authenticate their identity and enter one or moreaction markups for a particular element of a press release. Other formsof entry of action markups may include manual communication through ahelp desk via phone, fax, or email to help desk staff, who may thenenter the action markup(s) into the PATH software directly or through a“trader interface”. Another example of method for entering actionmarkup(s) would be via client software on a trader's machine thattransmits the action markup(s) to the PATH server software module 42.

FIG. 14 is an exemplary Web page version of a “trader interface”,according to an embodiment of the present invention. The “traderinterface” Web page 1400 may include an entry field 1405 for enteringthe name of a company from which an intended recipient may be expectingto receive a press release. The “trader interface” 1400 may also includea plurality of radio buttons 1410 corresponding to the type of expectedelement, such as current_earnings. The “trader interface” 1400 may alsoallow the user to enter a condition 1415 and a target value 1420 for theelement, such as “Less Than 1,200,000.” The final part of the “traderinterface” 1400 allows the user to set the action 1425 they would liketo receive if the condition is met, including an optional entry box 1430for an “other” type action not already listed in the action radiobuttons 1425.

Referring again to FIG. 13, after the user submits action markupinformation via the “trader interface” 1400, the information is placedby the PATH server software module 42 into a database table withinAction Markup Storage (not shown). An example of such a database tableis shown in Table 19 as follows:

TABLE 19 Field Name Field Type UserID integer Company text Element textCondition text Action text

An example of a record stored in the database for a trader identified bya “UserID” is shown in Table 20 as follows:

TABLE 20 UserID Company Element Condition Action 00012 IBMcurrent_earnings LT_350000 Sell

During the “marking phase” of the SEB/PATH method, the PATH serversoftware module 42 divides a document into SEBs to be transmitted asdescribed above, except when an IBlocks contains an “element”. In suchcircumstances, the IBlock is compared to certain patterns with a patternmatching method having natural language processing algorithms todetermine the context of the IBlock. The natural language processingalgorithms allow the PATH server software module 42 to recognize thecontext around the IBlock. If a document were to contain the statement,e.g.: “Earnings for the year 2009 were 2.5 million dollars”, the naturallanguage processing method would determine that the leading part of thestatement “Earnings for the year” indicates a current earningsstatement. In contrast, if the statement stated “Earnings for the year2009 were 2.5 million dollars, compared to earnings last year of 1.9million dollars”, the natural language processing method would disregardthe “1.9 million dollars” as a current earnings statement because of theleading context.

After a document is blocked and elementized, it is then assigned to arecipient. For each recipient, the Action Markup Storage (e.g., such asin Table 19) is checked for “action markups” corresponding to any“elements” contained in the document. If any are found for the recipientand “element” in the document, the matching action markup records (e.g.,such as in Table 20) are pulled from the Action Markup Storage. The“condition” of each action markup is then compared to the value of the“element.” For example, if the condition is “LT_(—)3.5 million”, thePATH server software module 42 parses the “$3.5 million” and comparesthat value to the element's value. For example, if the “element” is lessthan 3.5 million (e.g., $3.1 million), then the “condition” is met andthe action markup is stored for inclusion in the document. If the“condition” is not met, the action markup is discarded. After all of the“action markups” have been processed, the included ones are then parsedwith action markup tags. For example:

UserID Company Element Condition Action 00012 IBM current_earningsLT_350000 Sellbecomes

<Action Element=“current_earnings” Condition=“LT_(—)350,000”Message=“Sell” />

After the tag has been generated, the IBlock containing the element“current_earnings” is located. The action markup tag is then insertedinto the correct location following the IBlock.

The “transmission phase” of the SEB/PATH method may be modified fromwhat is described above according to whether “Markup Method 1” or“Markup Method 2” was employed. For “Markup Method 1”, the “action” tagis integral to the NIBlock and is transmitted as part of the NIBlock.This method permits different recipient to have different action markupsor no action markups and they are sent the NIBlock with no Pacing orHandicapping as per the previous NIBlock method. This happens after theprevious IBlock is SYNC'ed. For “Markup Method 2”, the “action” isplaced between the IBlock and the subsequent NIBlock. After SYNC'ing theIBlock, the action markup is transmitted only to users who desire toreceive it, while other recipients wait. After the action markups havebeen SYNC'ed, the subsequent NIBlock is transmitted to everyone.

For PUSH/PULL recipients receiving press releases, client software thatreceives the press releases is customized in the following way. At theapplication level, after an “impactful data element” is received by anintended recipient, the action markup may be communicated to theintended recipient by, for example, a pop-up notification message, achanging of visual effects of part of the press release (e.g., turningthe headline or element a particular color, indicating the “action”), ormanipulating another program via an Application Programming Interface(API). Manipulating another program via an API may include, but is notlimited to, automatically trading stocks via a trading platform,searching information about a company via a Web browser, or sending anemail via an email client.

As discussed above, according to an embodiment of the present invention,a variation of “action markup” is known as “editorial markup.” Thetrader markup may comprise an “element identifier” as discussed abovefor “action markup” and a “message.” There are other optional attributesthat may be associated with the editorial markup, including, but notlimited to, user identification information, company information, andapplicable date filters. The element identifier is a unique nameindicating a verbal description such as “current_earnings” or a numberreference. Elements throughout a document should be unique. If anelement appears twice in a document, the editorial markup may be placedonly once after the first instance of the element, or each instance maycontain the trader markup. Typically, the element identifier of theeditorial markup matches the name of the element tagged in the document,though the names are not required to match exactly.

The “message” associated with a editorial markup may comprise computergenerated content or human edited content. Computer generated contentmay comprise IBlock content, as well as surrounding content before andafter the IBlock. Human edited content may comprise an editor's opinionor facts about impactful content or insights into other relevantinformation. “Action markup” and “editorial markup” may herein bereferred to collectively as “trader markup”.

The trader markup may contain other information used by the PATHsoftware, such as user identification information, company information,and date filters. Some attributes may be automatically created from thetrader interface, such as the user identification information. Thetrader interface of FIG. 14 may be modified to include the additionalattributes, which may also be employed to limit which documents beingsent to a recipient will have the trader markup placed into it.

Since a document may have multiple IBlocks, the PATH software is notlimited to placing a single trader markup in a document. A trader markupmay be placed in a document for one or more impactful blocks. Similarly,there may be multiple trader markups for the same element, comprisingmultiple messages. For example, for an earnings statement element, afirst trader markup may comprise surrounding context of an IBlock, and asecond trader markup may comprise an editor's insight regarding theearnings statement.

A document must first be marked up, or elementized, to identifyinformation that may provide action, such as, but not limited to,earnings statements, sales figures, etc. An element may be identifiedwith tags which are placed directly into the document surrounding theelement. This may happen before the document is parsed into SEBs, suchas:

Company A's earnings were <earnings>1.5 million for fiscal year2009</earnings>.

The above content may be parsed into SEBs, wherein the entire earningselement may be placed into an IBlock based on pattern matching, such as:

Company A's earnings were <IBlock><earnings>1.5 million for fiscal year2009</earnings></IBlock>. Analysts had been looking for earnings...

The tag may also be combined as an attribute of an IBlock tag if theIBlock has been identified first via pattern matching. After the blocksare tagged, the IBlocks may be searched for the target element and theIBlock tag can be modified to include an attribute, such as:

Company A's earnings were <IBlock type=“earnings”>1.5 million for fiscalyear 2009</IBlock>. Analysts had been looking for earnings...

The editorial markup tag may be, but is not limited to, an XML styletag. The editorial markup tag may be any other style tag which maycontain attributes, such as HTML. The attributes of the tag include, butare not limited to, the element identifier and action messageattributes. An example of an XML style tag is:

-   -   <editorial element=“earnings” message=“earnings exceeded        expectations” />

In the above example, the name of the tag is “editorial”, the elementidentifier attribute is “earnings”, and the editorial message attributeis “earnings exceeded expectations”.

After an IBlock has been tagged as an element, the editorial markup maybe placed into the document following the tagged IBlock. The tradermarkup may be placed at the beginning of the NIBlock following thetagged IBlock, as such:

Company A's earnings were <IBlock type=“earnings”>1.5 million for fiscalyear 2009</IBlock><NIBlock><Editorial Element=“earnings”Message=“earnings exceeded expectations” />. Analysts had been lookingfor earnings...

A second markup method may include the editorial markup tags between theIBlock and following NIBlock, such as:

Company A's earnings were <IBlock type=“earnings”>1.5 million for fiscalyear 2009</IBlock><Editorial Element=“earnings” message=“earningsexceeded expectations” /><NIBlock>. Analysts had been looking forearnings...

To enter trader markup into a document for transmission, a trader mayset their trader markup preferences in the PATH software via a modifiedversion of the trader interface described above. The trader interfacemay include, but is not limited to, a web interface that allows tradersto authenticate their identity and enter one or more preferences forpress releases. Alternatively, the trader may communicate theirpreferences to a help desk via phone, fax, or email to help desk staff,who then enters the preferences into the PATH software directly orthrough the trader interface. In another embodiment, trader markuppreferences may alternatively be client software on the trader's machinethat transmits preferences to the PATH software server.

After the user submits trader markup preferences information, theinformation may be placed into a database which may contain suchpreferences as, including, but not limited to, user and type of tradermarkup. An example database table employed in a trader markup may be,for example:

Field Name Field Type UserID integer Message type editorial

A record stored in the database for a trader may be, for example:

UserID Company Element Condition Action 00012 IBM current_earningsLT_350000 Sell

For processing a trader markup, when a press release is received, thesystem may parse the press release into SEBs and assign any IBlocks anelement tag if it contains impactful information such ascurrent_earnings. The IBlock is compared to a pattern matching algorithmwith a natural language processing algorithms to determine the contextof the IBlock. The natural language processing allows the PATH softwareto recognize the context around the IBlock. In the case where a documentcontains the statement, “Earnings for the year 2009 were 2.5 milliondollars”, the natural language processing would determine that theleading part of the statement “Earnings for the year” indicates acurrent_earnings statement. In contrast, if the statement continued andstated “Earnings for the year 2009 were 2.5 million dollars, compared toearnings last year of 1.9 million dollars”, the natural languageprocessing would disregard the “1.9 million dollars” as a currentearnings statement because of the leading context.

After a document is blocked and elementized, it is then assigned to arecipient. For each recipient, trader markup storage may be checked fortrader markup preferences corresponding to that recipient. If therecipient has preferences for a type of trader markup, then that type oftrader markup is added for that recipient's document after each IBlock.

Client software which may receive a press release may be customized tohandle trader markup. At the application level, after a trader markup isreceived, the client software may interpret the trader markup to dosomething programmatically. This may include, but is not limited to,popping up a notification message, changing the visual effects of partof the press release (e.g., turning a headline or element a particularcolor indicating the trader markup), or manipulating another program viaan Application Programming Interface (API). Manipulating another programvia an API may include, but is not limited to, automatically displayinginformation, searching information about a company via a web browser, orsending an email via an email client.

According to an embodiment of the present invention, a trader markup maybe processed before transmission of a document, or it may be processedon the fly during transmission of the document. To process the tradermarkup before transmission, each IBlock with an element is searched foriteratively. When an IBlock is found, the trader markup is placed withthe NIBlock following the IBlock, according to the description above.The system then searches for and processes the next IBlock with anelement, continuing until the end of the document is reached. Forprocessing trader markup on the fly, after an IBlock with an element istransmitted, the trader markup for that element is processed andinserted in the following NIBlock. This process is repeated after thetransmission of each IBlock.

According to an embodiment of the present invention, a trader markup maybe placed at the end of a document. When an IBlock is processed fortrader markup, either iteratively or on the fly, the trader markup maybe appended to the end of the document, before the last closing NIBlocktag. This method permits the transmission of the trader markup to beincluded in the last NIBlock. If the document ends with an IBlock, thetrader markup tags are appended to the end of the IBlock, after the</IBlock> tag. The trader markup tags are then transmitted withoutpacing or handicapping, as for an NIBlock, after the IBlock is SYNC'ed.

According to an embodiment of the present invention, a second method fordelivering trader markup messages to a recipient may be employed. Thetrader interface may also include alternative message transmissionmethods such as SMS text, email, twitter, or any other messaging servicethat the trader may subscribe to. When a trader markup is transmittedafter an IBlock has been transmitted, the trader markup storage may besearched for alternative transmission preferences. If a trader has analternative transmission method selected, the server sends the tradermarkup message to the recipient using the alternative transmissionmethod provided that the transmission of the trader markup is performedafter the IBlock has been delivered, so that all impactful data is stillguaranteed to be received substantially simultaneously.

According to an embodiment of the present invention, an alternativeformatting may be employed for transmission via SMS text, twitter,email, or any other push or pull transmission method. The alternativeformat comprises a simplified version of content surrounding an IBlock.For each IBlock generated, the preceding NIBlock is replaced withcontent related to the IBlock. For instance, if the content included:

-   -   GM's earnings for the 4^(th) quarter of 2010 were $0.52 per        share        According to the SEB method described above, the content would        be parsed to appear as:

  <NIBlock>GM's earnings for the 4^(th) quarter of 2010 were</NIBlock><IBlock>$0.52 per share</IBlock>The alternative format locates the IBlock and preceding NIBlock andsimplifies them so that the resulting content may be something like:

-   -   <NIBlock>GM 4^(th) quarter earnings </NIBlock><IBlock>$0.52        share</IBlock>        This simplified format may either be computer generated or        edited by a human.

According to an embodiment of the present invention, another variationof the above described SEB method may also be employed. Throughout theRegEx pattern matching method described above, the IBlock content can beremoved from the content and stored in a table. A table to store IBlocksmay look something like this:

Block Location Reference Block Content 00001 IBlock 1 Content 00002IBlock 2 Content

In place of the removed content, a tag would be inserted to hold theplace of the IBlock content. A tag to hold the place of the content maycomprise an XML style tag, such as <IBlockHolder Reference=“00001” />,but is not limited to this format. Another method for marking theremoved IBlock content, is to insert a padded content string to hold theexact length of the removed IBlock content. An example of this type ofpadded tag to insert would be

-   -   <IBlockHolder Reference=“00001”>XXXXXXXXXXXXXXX</IBlockHolder>,        where the number of X's is equal to the length of the string        removed.

After the entire document has been traversed, NIBlock tags are placedbefore and after the entire content. The IBlock table is then used togenerate IBlock tags, which will be appended to the end of the document.The generated IBlocks will be put together as such:

  “<block type=“I” reference=“00001”>IBlock Content 1</block><blocktype=“I” reference=“0002”>IBlock Content 2</block>”.

The generated string is then appended to the end of the content afterthe closing NIBlock tag, e.g.,

  <block Type=“NI”> Content with IBlock Planceholders</block><blocktype=“I” Reference=“00001”>IBlock Content 1</block><block type=“I”reference=“0002”>IBlock Content 2</block>”.

An alternative method for generating the IBlock is to place them in onelarge IBlock containing all of the IBlock content. This would beaccomplished as such:

  <block type=“I”><IBlockContent reference=“00001”>IBlock Content1</IBlockContent><IBlockContent reference=“00002”>IBlock Content2</IBlockContent></block>

Appended after the NIBlock, it would appear as such:

  <block Type=“NI”> Content with IBlock Planceholders</block><blocktype=“I”><IBlockContent reference=“00001”>IBlock Content1</IBlockContent><IBlockContent reference=“00002”>IBlock Content2</IBlockContent></block>

Transmission of the Blocks would adhere to the previous methods, wherethe first large NIBlock is sent freely as a stream, or in 4 byte Units.The document is then SYNC'ed, and the one or more IBlocks are sent viathe PATH algorithm, with SYNC'ing in between. Receipt of the IBlocks isguaranteed to be simultaneous for all intensive purposes, with nofavorites or advantages.

On the receiving end, the client software is designed to piece togetherthe document. Each time an IBlock is received, the reference number issearched in the document and the IBlock tag is inserted into thedocument. The placeholder tag can be removed also. For example, after anIBlock is removed, the received content may appear as such:

<block type=“NI”>IBM made <IBlockHolder Reference=“00001” I> thismonth.</block>

The first IBlock received would appear similar to:

<block type=“I” reference=“00001” >$3,000,000</block>

The client software would begin searching the document for<IBlockPlaceHolder> tags. In this instance, it would find a match atindex 26, with a length of 34. The reference number would then becompared to the current IBlock being searched for. If the referencenumbers match, the matched content would then be deleted, and the IBlockwould be inserted at index 26, resulting in:

  <block type=“NI”>IBM made <block type=“I”reference=“00001”>$3,000,000</block> this month.</block>

If the first IBlockPlaceHolder tag did not have a matching referencenumber, then the search would continue to the next one and so on untilthe reference number was found.

To include action markup in this scenario, the IBlock tag may be pairedwith an action markup, such as:

<action reference=“0001” element=“earnings” condition=“LT 750,000”message=“sell” />

The action markup would be included after the corresponding IBlock.During insertion into the content, both the IBlock and action tags maybe inserted at the same time to generate:

  <block type=“NI”>IBM made <block type=“I”reference=“00001”>$3,000,000</block><action reference=“0001”element=“earnings” condition=“LT 750,000” message=“sell” /> thismonth.</block>

This would be repeated for each IBlock received.

In the case where multiple IBlockContent tags are placed in one IBlockand received at the same time, the document can be traversed once tolocate each IBlockPlaceHolder tag. The reference number of eachIBlockPlaceHolder tag is then compared to each IBlock that was received,and the current IBlockPlaceHolder tag is replaced with the matchingIBlockContent tag.

A third markup method includes the Trader Markup at the end of thedocument, after the final IBlock or NIBlock. In such a case the elementname would be unique for an IBlock, or a reference number may be used tolink IBlocks to Trader Markup tags.

   <block type=“NI”/>IBM made <block type=“I”reference=“00001”>$3,000,000</block>  this month.</block><actionreference=“0001” element=“earnings” condition=“LT  750,000”message=“sell” /> Or  <block type=“NI”>IBM made <block type=“I”type=“earnings”>$3,000,000</block> this  month.</block><actionreference=“0001” element=“earnings” condition=“LT 750,000” message=“sell” />

A fourth markup method includes the Trader Markup at the end of thedocument which has not been markup into blocks. Using this method,IBlocks are identified using the above method to locate elements such asearning, but the impactful content is not tagged. In such a case theelement name would be unique for a document and included at the end ofthe unmarked document.

  <HTML><body><p>IBM made $3,000,000 thismonth.</p></body></HTML><action element=“earnings” condition=“LT750,000” message=“sell” />The document may be, but is not limited to, an HTML, XML, or plaintextdocument.

According to an embodiment of the present invention, the SEB method/PATHprotocol is further applicable to facilitating the receipt of impactfulinformation embedded within binary images or documents (collectivelyreferred to herein as a “binary document”). The binary document mayinclude, but are not limited to, a binary document of the following filetypes: GIF, JPEG, PNG, PDF, or any other binary format which cannot beedited with a text editor.

According to an embodiment of the present invention, to illustrate howthe SEB method may be modified to transmit binary documents, oneintended recipient may desire to receive an HTML, XML, or plaintextASCII version of an original document, while one or more other intendedrecipients may desire to receive a binary version of the same documentGIF, JPEG, PNG, PDF, etc., that would appear in their Web browser asplaintext. In the following example, it is assumed that the firstintended recipient is to receive an ASCII document formatted in HTML,while other intended recipient receive a binary version of the samedocument.

Blocking in a modified “marking phase” of the SEB method is applied toan HTML, XML, or plaintext ASCII version of the original document.Assuming the first recipient desires to receive an ASCII HTML formatteddocument, an example HTML document may comprise the following:

<html><body>In the fourth quarter of 2010,<br>IBM earned 3.5 billiondollars.</body></html>

SEBs may be created in the HTML document according to one of the SEBmethod described above. The HTML document delimited by NIBlocks/IBlocksappears as follows:

<NIBlock><html><body> In the fourth quarter of 2010,<br>IBM earned</NIBlock><IBlock>3.5 billiondollars</IBlock><NIBlock>.</body></html></NIBlock>

This document will herein be called HTML Document 1.

After the IBlocks are delimited, additional pairs of tags may beinserted before and after the context of the IBlocks in HTML Document 1to identify the IBlocks. These tags may be, but are not limited to, HTMLor XML style tags depending on the document type, and are intended tohighlight the content of an IBlock by changing one of its attributes,e.g., color, font type, font size, case, etc., such as the following tagpairs: <i> and </i>, <b> and </b>, and <span color=“Red”> and </span>.

To insert <i> and </i> tags into the above document, the index of the<IBlock> tag is located and the length of “<IBlock>” is added todetermine the insertion point. Thus, for:

<NIBlock><html><body> In the fourth quarter of 2010,<br>IBM earned</NIBlock><IBlock>3.5 billiondollars</IBlock><NIBlock>.</body></html></NIBlock>The index of <IBlock> is 77, plus the length of “<IBlock>” is 8. As aresult, the insertion point for the first tag in the pair, <i>, is atindex 85, as follows:

<NIBlock><html><body> In the fourth quarter of 2010,<br>IBM earned</NIBlock><IBlock><i>3.5 billiondollars</IBlock><NIBlock>.</body></html></NIBlock>To insert the second tag, the </IBlock> after the last insertion pointis located. In the example above, the index of </IBlock> is at index107. As a result, the </i> tag is inserted at index 107 as follows:

<NIBlock><html><body> In the fourth quarter of 2010,<br>IBM earned</NIBlock><IBlock><i>3.5 billiondollars</i></IBlock><NIBlock>.</body></html></NIBlock>This document will herein be called HTML Document 2. According to anembodiment of the present invention, HTML Document 1 and HTML Document 2are retained for image generation.

Image Generation is handled through a third party HTML to imagegenerator, but may be created using other methods. HTML Document 1 andHTML Document 2 are used to generate two binary images, called BinaryDocument 1 and Binary Document 2, respectively. The binary documentsappear the same as the HTML documents would appear after being renderedin a browser, as seen in the charts below:

HTML Document 1 HTML Document 1 rendered in a browser Binary Document 1<NIBlock><html><body> In the fourth quarter of 2010,<br>IBM earned</NIBlock><IBlock><i>3.5 In the fourth quarter of 2010, IBM earned 3.5billion dollars.

billion dollars</i></IBlock> <NIBlock>.</body> </html></NIBlock> HTMLDocument 2 HTML Document 2 rendered in a browser Binary Document 2<NIBlock><html><body> In the fourth quarter of 2010,<br>IBM earned</NIBlock><IBlock><i>3.5 In the fourth quarter of 2010, IBM earned 3.5billion dollars.

billion dollars</i></IBlock> <NIBlock>.</body> </html></NIBlock>

In the charts above, a border has been placed around the rendered imagesto demonstrate the approximate size of the image. An actual generatedimage may not have a border and the margin around the text may smallerthan shown above.

The two binary documents are compared to locate the byte numbers ofimpactful data in Binary Document 1. By comparing the bytes of BinaryDocument 1 and Binary Document 2, the text which has been changed by thetags may be identified and located, e.g., what is rendered in italics.

In the example above, if both Binary Document 1 and Binary Document 2are in GIF format, the binary of the two images comprise many sectionsthat are similar, and differences appear where the content of the twoimages are different, i.e., where the text is italics in one documentand not in the other.

By comparing the binary data of the two resulting images, byte locationsof changes between Binary Document 1 and Binary Document 2 (i.e., thetext in italics) may be calculated to determine which correspondingbytes in the original binary document contain the same text.

For example, if Binary Document 1 and Binary Document 2 are 100 bytes inlength, and the bytes in Binary Document 1 differ from Binary Document 2at bytes 60-79, then the text of the IBlock is located at bytes 60-79 inBinary Document 1.

After the IBlock byte locations have been determined, Binary Document 1may be transmitted via the PATH protocol along with the HTML document 1.In the example above, the first NIBlock is at byte locations 0-59, theIBlock is at byte locations 60-79 based on the byte calculationdescribed above, and the last NIBlock is at remaining byte locations80-99.

The table below shows blocks for transmitting HTML Document 1 and BinaryDocument 1, substantially simultaneously while complying with Reg FD.

Block Type HTML Document 1 Binary Document 1 NIBlock <NIBlock><html> 0-59 <body> In the fourth quarter of 2010,<br> IBM earned </NIBlock>IBlock <IBlock>3.5 billion 60-79 dollars</IBlock> NIBlock <NIBlock>.80-99 </body> </html></NIBlock>

Transmission of the documents proceeds as follows. For all recipients,the first NIBlock of their assigned document version is transmitted.According to PATH, the transmission is then SYNC'd for all recipients toensure receipt of the transmission. After confirmation of receipt, thePATH protocol is then applied to transmitting the IBlocks of eachdocument to the corresponding recipients.

The documents may be broken into 4 byte U's, as follows:

HTML Document 1 Binary Document 1 U Number Character Content ByteContent 1 <IBl 60-63 2 ock> 64-67 3 3.5 68-71 4 bill 72-75 5 ion 76-79 6doll 7 ars< 8 /IBl 9 ock>

The U's are then paced and handicapped according to half-RTT timescalculated after receiving acknowledgment packets during thetransmission of the first NIBlocks of each document according to thePATH protocol described above. After the last U is sent, the recipientsare SYNC'ed to ensure all recipients receive the IBlock content. Thefinal NIBlock data is transmitted to each recipient to complete thetransmission.

To further exemplify the binary comparison, FIGS. 15A-15D include binarydata of two GIF images, one with all black content, and one with blackand red content, respectively. Within FIGS. 15A-15D, the following twosegments from the end of the binary are compared to determinedifferences in the bytes:

From 15A and 15B: 00000310 01 00 00 10 00 2C 00 00 00 00 02 00 01 00 0008 00000320 05 00 51 A0 08 08 00 3B From 15C and 15D: 00000300 33 FF FF66 FF FF 99 FF FF CC FF FF FF 2C 00 00 00000310 00 00 02 00 01 00 00 0805 00 01 24 08 08 00 3B

Looking at specific bytes in these segments, the following five bytes inFIGS. 15A and 15B are the data: “00 51 A0 08 08”, and the following fivebytes in FIGS. 15C and 15D are the data “00 01 24 08 08”. In comparingthese two byte segments, the bytes “51 A0” in FIGS. 15A and 15B aredetermined to be different from the bytes “01 24” in FIGS. 15C and 15D.

The byte locations of “51 A0” in the document corresponding to FIGS. 15Aand 15B are located at decimal byte numbers 770 and 771 (hexadecimal bynumbers 322 and 323, respectively). The location of the IBlock is atbytes 770 and 771 in the corresponding image. As a result, the number ofbytes to transmit for the NIBlocks and IBlocks may be determined, asshown in the table below:

Block Type Binary Document Bytes NIBlock  0-769 IBlock 770-771 NIBlock772-775

If the first document intended for the first recipient were formatted inplaintext instead of HTML, the SEB “marking” and “transmission” phaseswould be applied as previously described hereinabove, but a secondversion of the first plaintext document would be generated in rich textformat (RTF) to permit the insertion of highlighted text via metadata,rather than tags. The metadata at the beginning of the content includes,for example, color/highlighting/italics information as well as thelocation of the text to be highlighted. In such circumstances, the taginsertion method is bypassed and an analogous metadata modificationmethod is implemented.

If the first document intended for the first recipient were formatted ina version of binary plaintext or binary plaintext with tags (e.g., HTML,XML, etc.) instead of plaintext HTML, the binary text document is firstconverted to ASCII plaintext via optical character recognition, and thenthe SEB “marking” and “transmission” method just described for an ASCIIplaintext document with RTF would be applied.

Embodiments of the method for transmitting binary-formatted documentsare not strictly limited to text, but may be applicable to any binaryimage containing impactful information. For example, still images orvideo containing pixels that may be impactful to a trader may beformatted and transmitted by pacing and handicapping the entire binaryimage for transmission if the entire image is impactful, or a particularpart of the image may be identified as impactful. In the latter case, anidentification method may be applied to the image such as facialrecognition, color location, or any other method for locating contentwithin an image. Once the location of impactful content is identifiedand the bytes are located, the document is transmitted according to thePATH protocol.

In another embodiment of combining multiple simultaneous disclosuregroups, trader markup, and individual groups containing a laggard, thefollowing steps may be applied: 1) applying the PATH algorithm fordistributing documents to the first simultaneous group, 2) movinglaggards to the next simultaneous group or to the individuals group, 3)sending trader markup freely to subscribers after the simultaneous grouphas finished sync'ing immediately or after a specified time has passed,4) repeating steps 1-3 for each simultaneous group after the previousaction markup or simultaneous group has completed, and 5) transmittingto individuals and laggards that are not in the simultaneous group afterthe last simultaneous group or action markup subscribers have completed,either immediately or after a specified time has passed.

In another embodiment of Action Markup and PATH, a notification documentto be transmitted via PATH to a Web server may be employed as a triggermechanism for the Web server to activate or enable a Web page containinga source document (e.g., a press release) to be made available to one ormore intended recipients. In such circumstances, the Web server may haveinstalled and be running a software package that is configured toreceive documents. To effect simultaneous receipt of the notificationdocument along with a simultaneous group of intended recipients, the Webserver may be included in the simultaneous group that employs the PATHprotocol described previously. In certain embodiments of the triggermechanism, a software module that is to receive the notificationdocument may be located on another server distinct from the Web serverthat is configured to communicate with the Web Server or is operable tomake the source document available through another method to bedescribed hereinbelow.

Notice Exact Access Timing (NEAT)

As used herein, the term Notice Exact Access Timing (NEAT) refers to amethod of including a Web server in a simultaneous group employing PATH,such that the Web server receives a notification document substantiallysimultaneously with all of the intended recipients in the simultaneousdisclosure group (who may be receiving the notification or the sourcedocument). The notification document sent to the Web server acts atrigger for the Web server to display a source document on a Web page,and the notification document sent to a selection of other intendedrecipients in the simultaneous disclosure group includes a hyperlinklinking to that Web page. By employing the PATH protocol in transmittingthe notification document, the Web page containing the source documentis posted on the Web server and the other recipients receive thehyperlink substantially simultaneously.

The Notification Document

According to an embodiment of the present invention, a notificationdocument including a hyperlink linking to a source document may include,but is not limited to, the following:

“Company A Press Release

The press release can be viewed at www.CompanyA.com/PressRelease.html”

In such circumstances, the hyperlink is operable to link to a Web pagelocated on the same Web server included in the simultaneous disclosuregroup. As a result, the Web server may receive a notification document(which may take one of many forms to be described hereinbelow, and whichmay or may not take the same form as a notification document sent toother intended recipients) substantially simultaneously as thenotification document received by a selection of the rest of theintended recipients of the simultaneous disclosure group. As a result,the Web server may post a Web page containing a source document (i.e.,the press release) at substantially the same time that the otherrecipients receive the link (i.e., the notification document).

According to an embodiment of the present invention, the notificationdocument sent to the Web server may take the form of an HTML documentthat includes a source document linked to in the notification documentsent to the other intended recipients. In such circumstances, the Webserver may receive the source document and copy or move it to adirectory recognized by the Web server to make it available to the otherintended recipients. The HTML document may or may not include an actionmarkup appended to the end of source document, after the HTML content.If included, the action markup may be used to specify special directionsto the Web server, such as date and time to release the source document,or it may reiterate that the source document is a trigger and it needsto be posted for the other intended recipients to access. A non-limitingexample of such an action markup is listed as follows:

“<html>HTML Content</html><Action Element=“notice” Message=“access” />”

In another embodiment of NEAT, the Web server may already have access toa stored source document that needs to be posted. In such circumstances,a notification document is sent to the Web server which need not includea source document. The notification document may simply be a messageidentifying the stored source document, or even the same URL link sentto the rest of the simultaneous disclosure group. A non-limiting exampleof a notification document may include the following:

“<ReleaseDoc name=“DocumentName” />”

In circumstances in which a tag is used, the Web server is expecting aspecific tag to identify the stored source document and release it. TheWeb server may parse the notification document to extract the storedsource document name or a Web page address, and unlock or release thestored source document for access from a Web browser. The tag mayinclude optional attributes such as a date and time stamp indicating atime to release the stored source document by the Web server.

Source Document Release

On the Web server, software modules such as, but not limited to, ApacheHTTP Server, Internet Information Services (IIS), Lighttpd, Nginx,Documentum, SharePoint, and Alfresco are designed to serve Web pages anddocuments using HTTP to requesting Web browsers. Most Web serversoftware packages and content or document management systems provide amechanism to lock documents present on the Web server and prevent thelocked documents from being viewed by requesting Web browsers. The Webserver may have file system directories which are not available to theWeb server software, or a lock file may be located in the same filesystem directory as the Web page. The Web server software may also beconfigured to block a particular file or directory from being availableto requesting Web browsers.

Because there are several methods available in the art for Web serversoftware to prevent a document from unauthorized access, such methodsmay be employed to enable access to a source document that has beenlocked. File and directory locking methods vary between Web servers, afew of which are described hereinbelow for illustrative purposes. Manyof these mechanisms may be described as server side scripting orprocessing and atomic file operations.

If the source document is received by the Web server via a notificationdocument and via receiving software located on the Web server, thesource document may be moved into a file system directory that isrecognized by the Web server software. The Web server may execute a moveor copy command to place the source document in a Web server directory,permitting it to be available to an external Web browser. If thereceiving software is located on another server, the source document maybe transmitted to the Web server via any suitable file transmissionmethod, including, but not limited to, SCP, FTP, or socket streaming andplaced in a server directory. A directory containing the source documentmay be moved under a directory used by the Web server to render thesource document available.

In one embodiment, a Web server may already include the source documentstored thereon and may be waiting for a release notification. In suchcircumstances, the source document may be unlocked by removing a filelock from a directory where the source document is located, such as, butnot limited to, an .htaccess file. Removing the file lock permits theWeb server to make documents in the same directory available torequesting Web browsers. In another embodiment, the Web server, havingan unlocked copy of the source document, may employ a move or copycommand to place the source document in a Web server directory when thetrigger is received.

In an advanced method for unlocking content, a Web page may be availablebefore the release of the source document, but the Web page may employ ascripting language, such as PHP or Javascript, or other Web programminglanguage, to request the source document from another source, such as adatabase or other content feeder. In such circumstances, when the Webserver or another server receives the trigger, an unlock flag field isset in the database corresponding to the source document.

When a request is made for a source document from an external Webbrowser, the Web server requests the content (i.e., the source document)from its database or other content source to display the source documenton the requesting Web page. If the source document is requested beforethe trigger has been received and the unlock flag is set, the externalWeb browser receives an unavailable message. When the unlock flag isset, the external Web browsers is permitted to view the source document.This method also works in circumstances where the source document isreceived when employing PATH protocol and is loaded into the databaseand the unlock flag is set immediately. Scripting software within arequesting Web page may already contain the source document, but doesnot display the source document unless a configuration file or otherlocking mechanism is found on the Web server to enable the sourcedocument to be displayed.

In an embodiment, another method for unlocking a source document is viaa Web server that permits requests to an external Web page but withholdsthe transmission of the source document over the requesting connectionor channel until such time that a Web server process receives a signalto release the requested source document. The Web server may returnephemeral content to the Web browser specifying a refresh period untilthe source document is available. External Web browsers requesting thesource document will not view any content until the Web browserdiscontinues returning refreshes, such as a meta-refresh, and returnsthe requested source document.

In an embodiment, the Web server may be unlocked when the receivingsoftware starts the Web server software if it was not running, or theWeb server may enable itself at a specified time.

A person skilled in the art would appreciate that there are numerousmethods by which the source document may be make available on a Webserver, with each Web server software package operable to release asource document after receiving the source document or a trigger throughAction Markup and PATH.

When a trigger includes a date and time attribute, the receivingsoftware may wait until a specified time to execute any of the aboveunlocking methods. Other attributes may affect the execution of theabove unlocking methods.

It is to be understood that the exemplary embodiments are merelyillustrative of the invention and that many variations of theabove-described embodiments may be devised by one skilled in the artwithout departing from the scope of the invention. It is thereforeintended that all such variations be included within the scope of thefollowing claims and their equivalents.

What is claimed is:
 1. A method, comprising: determining, by a computingdevice, impactful content in transmittable content; assigning, by thecomputing device, the impactful content in the transmittable content toone or more impactful block units, each impactful block unit comprisinga determined numbers of characters; extracting, by the computing device,the one or more impactful block units from the transmittable content;placing, by the computing device, the one or more impactful block unitsat the end of the transmittable content; and transmitting, by thecomputing device, the transmittable content to a plurality of intendedrecipients, each character, or a small packet set of sequentialcharacters, of the determined number of characters of the one or moreimpactful block units transmitted using a time delay for a particularintended recipient and a pacing method, the one or more impactful blockunits to be received substantially simultaneously by the plurality ofintended recipients; wherein the time delay for the particular intendedrecipient is set to the difference between ½ of a longest round triptime among all of the intended recipients and ½ the round trip time ofthe particular intended recipient.
 2. The method of claim 1, furthercomprising grouping the one or more impactful block units into a singleimpactful block before said transmitting the transmittable content. 3.The method of claim 1, further comprising filling the former locationsof one or more impactful block units in the transmittable content withcorresponding one or more placeholders.
 4. The method of claim 3,wherein the one or more placeholders are one or more reference tagsindicating a particular impactful block, wherein the impactful blockcomprises at least one of the one or more consecutive impactful blockunits.
 5. The method of claim 3, further comprising filing the one ormore placeholders with one or more padded content strings to hold theexact length of an impactful block comprising at least one of the one ormore consecutive impactful block units.
 6. The method of claim 3,wherein the one or more placeholders are configured to cause an intendedrecipient computing device to remove each of the one or moreplaceholders and place corresponding ones of the one or more impactfulblock units to their former locations in the transmittable content. 7.The method of claim 1, wherein impactful content refers to any portionof the transmittable content that impacts a financial-related action. 8.The method of claim 1, further comprising: assigning, by the computingdevice, the remainder of the transmittable content to one or morenon-impactful block units, each non-impactful block unit comprising thedetermined numbers of characters.
 9. The method of claim 8, wherein eachcharacter of the determined number of characters of the one or morenon-impactful block units are transmitted without the time delay for aparticular intended recipient and the pacing method.
 10. The method ofclaim 1, wherein the pacing method comprises commencement oftransmission of the one or more impactful block units over a pacing timeinterval to ensure an evenly-distributed flow of bytes across aplurality of receivers.
 11. The method of claim 10, wherein the pacingtime interval is equal to a reciprocal of a longest total transmissiontime taken for each intended recipient to receive the impactful blockunit divided by each recipient's number of bytes in an impactful blockunit.
 12. The method of claim 1, further comprising synchronizingconnections for each of the intended recipients.
 13. The method of claim1, wherein an impactful block unit comprises one or more sub blockunits, wherein synchronizing connections comprises waiting until allacknowledgement packets corresponding to a last transmitted sub blockunit transmitted to each of the plurality of intended recipients hasbeen received before transmitting a next sub block unit to each of theplurality of intended recipients.
 14. A non-transitory computer-readablestorage medium carrying one or more sequences of instructions that, whenaccessed by a computing device, causes the computing device to performoperations comprising: determining, by the computing device, impactfulcontent in transmittable content; assigning, by the computing device,the impactful content in the transmittable content to one or moreimpactful block units, each impactful block unit comprising a determinednumbers of characters; extracting, by the computing device, the one ormore impactful block units from the transmittable content; placing, bythe computing device, the one or more impactful block units at the endof the transmittable content; and transmitting, by the computing device,the transmittable content to a plurality of intended recipients, eachcharacter, or a small packet set of sequential characters, of thedetermined number of characters of the one or more impactful block unitstransmitted using a time delay for a particular intended recipient and apacing method, the one or more impactful block units to be receivedsubstantially simultaneously by the plurality of intended recipients;wherein the time delay for the particular intended recipient is set tothe difference between ½ of a longest round trip time among all of theintended recipients and ½ the round trip time of the particular intendedrecipient.
 15. The non-transitory computer-readable storage medium ofclaim 14, further comprising grouping the one or more impactful blockunits into a single impactful block before said transmitting thetransmittable content.
 16. The non-transitory computer-readable storagemedium of claim 14, further comprising filling the former locations ofone or more impactful block units in the transmittable content withcorresponding one or more placeholders.
 17. A system, comprising: amemory; a computing device, operatively coupled to the memory, thecomputing device to: determine impactful content in transmittablecontent; assign the impactful content in the transmittable content toone or more impactful block units, each impactful block unit comprisinga determined numbers of characters; extract the one or more impactfulblock units from the transmittable content; placing, by the computingdevice, the one or more impactful block units at the end of thetransmittable content; and transmit the transmittable content to aplurality of intended recipients, each character, or a small packet setof sequential characters, of the determined number of characters of theone or more impactful block units transmitted using a time delay for aparticular intended recipient and a pacing method, the one or moreimpactful block units to be received substantially simultaneously by theplurality of intended recipients; wherein the time delay for theparticular intended recipient is set to the difference between ½ of alongest round trip time among all of the intended recipients and ½ theround trip time of the particular intended recipient.
 18. The system ofclaim 17, further comprising grouping the one or more impactful blockunits into a single impactful block before said transmitting thetransmittable content.
 19. The system of claim 17, further comprisingfilling the former locations of one or more impactful block units in thetransmittable content with corresponding one or more placeholders.